Combinatorics / CONCEPT
Boundary charging for degree-two vertices
Boundary charging for degree-two vertices
Closed
DIRECT PREREQUISITES0
DIRECT CONSEQUENCES2
PROOF DEPTH0
DOCUMENT LINKS0
Two orders of incidence counting
RELATIONSHIP ATLAS
Every connection, in context.
Direct recorded relationships
Proof dependencyStructural affinityDocument link
Certified topology / UPSTREAM
Prerequisites
None recorded in this release.
Certified topology / DOWNSTREAM
Consequences
RELATED KNOWLEDGE
Structural connections
- Critical Vertices and Private Neighboursstructural-affinity · Closed
- Necessary incidence restrictions for weak-four landmarksstructural-affinity · Closed
- Neighbour Replacement for Self-Critical Verticesstructural-affinity · Closed
- Separation and landmark degrees in rectangular Hamming graphsstructural-affinity · Closed
- Shortest distances and weak-four separation in direct squaresstructural-affinity · Closed
- The exceptional order-five obstructionstructural-affinity · Closed
- The Luiz–Vieira generalized Blanuša closing conjecture is falsestructural-affinity · Closed
- The universal linear lower estimatestructural-affinity · Closed
Documents & exposition
None recorded in this release.
Other authored & advisory relationships
None recorded in this release.
LIBRARY / RELEASE VERSIONS
Content history
Loading release versions...
Browse the archiveCertified provenance