Combinatorics / CONCEPT
Sublinear edge completion for consecutive cycle sums
For every positive natural a, every sufficiently large consecutively labelled cycle can be completed using at most n/a added edges; a hub and tail construction uses fewer than the square root of 2n + 8 edges for n at least eight.
Closed
DIRECT PREREQUISITES2
DIRECT CONSEQUENCES0
PROOF DEPTH1
DOCUMENT LINKS0
The eventual edge budget holds
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
- Rooted decomposition and the connected minus-four familystructural-affinity · Closed
- The hub and tail construction for consecutive cycle sumsstructural-affinity · Closed
- The order-33 integer domination-root minimality claimstructural-affinity · Closed
- Triangular cores and interval subset sumsstructural-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