Combinatorics / CONCEPT
The asymptotic graph Ky Fan conjecture
Infinitely many graph Ky Fan prefixes have strict asymptotic gaps.
Closed
DIRECT PREREQUISITES2
DIRECT CONSEQUENCES0
PROOF DEPTH9
DOCUMENT LINKS0
Infinitely many strict gaps
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
- Approximation and row concentrationstructural-affinity · Closed
- Blow-ups and asymptotic graph maximastructural-affinity · Closed
- Dischargestructural-affinity · Closed
- Finalstructural-affinity · Closed
- Params Adopted2structural-affinity · Closed
- State Invariantstructural-affinity · Closed
- State Invariant2structural-affinity · Closed
- State Invariant3structural-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