Combinatorics / CONCEPT
A Tree Exceeds the Path in the Cordiality Game
A tree on ten vertices forces discrepancy at least three, while Admirable can hold the path on ten vertices to discrepancy at most one.
Closed
DIRECT PREREQUISITES1
DIRECT CONSEQUENCES0
PROOF DEPTH1
DOCUMENT LINKS0
A ten-vertex counterexample
RELATIONSHIP ATLAS
Every connection, in context.
Direct recorded relationships
Proof dependencyStructural affinityDocument link
Certified topology / UPSTREAM
Prerequisites
Certified topology / DOWNSTREAM
Consequences
None recorded in this release.
RELATED KNOWLEDGE
Structural connections
- Gupta's rectangular-grid dispersion inequalitystructural-affinity · Closed
- Integer {2}-domination of three-row gridsstructural-affinity · Closed
- The 2-neighbour bootstrap percolation number of C_n x P_m is nstructural-affinity · Closed
- Weak products do not preserve edge-complexity equalitystructural-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