ConceptDynamics / CONCEPT
Maximum degree and literal Fibonacci digit deletion
The ordinary maximum degree of every positive-order recursive linear Jaco graph is its same-index literal Zeckendorf deletion.
Closed
DIRECT PREREQUISITES3
DIRECT CONSEQUENCES2
PROOF DEPTH14
DOCUMENT LINKS0
Count both kinds of neighbors
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
- A Dom-Path Longer Than the Jaco Graph Diameter Boundstructural-affinity · Closed
- Bounded complete residual representativesstructural-affinity · Closed
- Decorated Fibonacci Windowsstructural-affinity · Closed
- Directed paths and their cardinalitystructural-affinity · Closed
- Golden Desubstitution in Zeckendorf Coordinatesstructural-affinity · Closed
- Literal Zeckendorf deletionstructural-affinity · Closed
- The Domination Clause of Kok's Jaco Graph Conjecturestructural-affinity · Closed
- The original Jaco addition law is falsestructural-affinity · Closed
- The recursive Jaco endpoint lawstructural-affinity · Closed
- Unique values across all Jaco graph ordersstructural-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