Combinatorics / CONCEPT
Separation and landmark degrees in rectangular Hamming graphs
Weak two-resolving sets in a rectangular Hamming graph are governed by their row degrees, column degrees, and the endpoint degrees of disjoint landmarks.
Closed
DIRECT PREREQUISITES0
DIRECT CONSEQUENCES3
PROOF DEPTH0
DOCUMENT LINKS0
Row degree sum
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
- 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
- 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
- Shortest distances and weak-four separation in direct squaresstructural-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