Combinatorics / CONCEPT
The large cubic graph construction
Strict event counting supplies AR-labelings of large cubic graphs.
Closed
DIRECT PREREQUISITES2
DIRECT CONSEQUENCES1
PROOF DEPTH3
DOCUMENT LINKS0
An AR-labeling with the exact interval of labels
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
- Avoiding all local collisionsstructural-affinity · Closed
- Counting additive triples for cubic AR labelingstructural-affinity · Closed
- Counting cubic AR-labelingsstructural-affinity · Closed
- Cubic graphs are additively rigidstructural-affinity · Closed
- Equal parity in the first two valuesstructural-affinity · Closed
- Free-triple bad eventsstructural-affinity · Closed
- Marked-edge bad eventsstructural-affinity · Closed
- Standard small cubic graph formsstructural-affinity · Closed
- The small cubic graphsstructural-affinity · Closed
- Total edge-label extensionstructural-affinity · Closed
- Transport of additive rigiditystructural-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