Combinatorics / CONCEPT
The extremal matching number for odd degrees
The least matching number of an almost regular, triangle-free, factor-critical graph has an exact formula for every odd degree at least twenty-one.
Closed
DIRECT PREREQUISITES6
DIRECT CONSEQUENCES0
PROOF DEPTH6
DOCUMENT LINKS0
The conjectured equality
RELATIONSHIP ATLAS
Every connection, in context.
Direct recorded relationships
Proof dependencyStructural affinityDocument link
Certified topology / UPSTREAM
Prerequisites
- A regular biconnected graph with a positive fourth difference of ln(i! N(i))truth-dependency · Closed
- AhanjidehEkimYildizZUppertruth-dependency · Closed
- DenseTriangleFreeConfigurationstruth-dependency · Closed
- FactorCriticalMatchingtruth-dependency · Closed
- HaggkvistPentagonHomomorphismtruth-dependency · Closed
- PentagonMissingEdgeObstructiontruth-dependency · Closed
Certified topology / DOWNSTREAM
Consequences
None recorded in this release.
RELATED KNOWLEDGE
Structural connections
- A flat graph whose clique polynomial has a nonreal rootstructural-affinity · Closed
- A regular biconnected graph with a positive fourth difference of ln(i! N(i))structural-affinity · Closed
- AhanjidehEkimYildizZUpperstructural-affinity · Closed
- DenseTriangleFreeConfigurationsstructural-affinity · Closed
- FactorCriticalMatchingstructural-affinity · Closed
- HaggkvistPentagonHomomorphismstructural-affinity · Closed
- Matching Monomial Fibersstructural-affinity · Closed
- Matching Polynomial Formulastructural-affinity · Closed
- PentagonMissingEdgeObstructionstructural-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