Combinatorics / CONCEPT
The universal linear lower estimate
The universal linear lower estimate
Closed
DIRECT PREREQUISITES1
DIRECT CONSEQUENCES1
PROOF DEPTH3
DOCUMENT LINKS0
Edges equal landmarks
RELATIONSHIP ATLAS
Every connection, in context.
Direct recorded relationships
Proof dependencyStructural affinityDocument link
Certified topology / UPSTREAM
Prerequisites
Certified topology / DOWNSTREAM
Consequences
RELATED KNOWLEDGE
Structural connections
- A sufficient incidence criterion and its assembly lawsstructural-affinity · Closed
- Boundary charging for degree-two verticesstructural-affinity · Closed
- Equality-size constructions at every orderstructural-affinity · Closed
- Exact weak-four metric dimension of complete graph direct squaresstructural-affinity · Closed
- Necessary incidence restrictions for weak-four landmarksstructural-affinity · Closed
- Reciprocal-degree charging for rectangular Hamming graphsstructural-affinity · Closed
- Rectangular weak two-metric dimension below the thresholdstructural-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
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