Combinatorics / CONCEPT
Counting additive triples for cubic AR labeling
The additive-triple cardinality and the strict cubic-labeling union bound.
Closed
DIRECT PREREQUISITES0
DIRECT CONSEQUENCES2
PROOF DEPTH0
DOCUMENT LINKS0
The additive-triple constraints
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
- Additively rigid vertexstructural-affinity · Closed
- Avoiding all local collisionsstructural-affinity · Closed
- Counting cubic AR-labelingsstructural-affinity · Closed
- Free-triple bad eventsstructural-affinity · Closed
- Marked-edge bad eventsstructural-affinity · Closed
- Standard small cubic graph formsstructural-affinity · Closed
- The large cubic graph constructionstructural-affinity · Closed
- Total edge-label extensionstructural-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