ConceptDynamics / CONCEPT
A Dom-Path Longer Than the Jaco Graph Diameter Bound
The finite linear Jaco graph on 33 vertices refutes Kok's dom-path diameter conjecture.
Closed
DIRECT PREREQUISITES2
DIRECT CONSEQUENCES1
PROOF DEPTH1
DOCUMENT LINKS1
Conjecture 2.9 is false
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
- An obstruction to global coalition universalitystructural-affinity · Closed
- Božović Conjecture 12: limited domination in Sierpiński graphsstructural-affinity · Closed
- Directed paths and their cardinalitystructural-affinity · Closed
- Finite dominating-set averagesstructural-affinity · Closed
- Five paired coalition parts in the height-five binary treestructural-affinity · Closed
- Literal Zeckendorf deletionstructural-affinity · Closed
- Maximum degree and literal Fibonacci digit deletionstructural-affinity · Closed
- Refutation of Annor Conjecture 14structural-affinity · Closed
- Regular Graph Covers and Dominationstructural-affinity · Closed
- The Domination Clause of Kok's Jaco Graph Conjecturestructural-affinity · Closed
- The Koch-Narayan bipartite edge bound is falsestructural-affinity · Closed
- The recursive Jaco endpoint lawstructural-affinity · Closed
Documents & exposition
Other authored & advisory relationships
None recorded in this release.
LIBRARY / RELEASE VERSIONS
Content history
Loading release versions...
Browse the archiveCertified provenance