Combinatorics / CONCEPT
FactorCriticalMatching
Finite graph structure, degree counting, and perfect matchings.
Closed
DIRECT PREREQUISITES2
DIRECT CONSEQUENCES2
PROOF DEPTH4
DOCUMENT LINKS0
odd order
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 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
- Conditional Finite Additive Preservationstructural-affinity · Closed
- DenseTriangleFreeConfigurationsstructural-affinity · Closed
- Finite Convolution Coefficientsstructural-affinity · Closed
- HaggkvistPentagonHomomorphismstructural-affinity · Closed
- Matching Fiber Equivalencestructural-affinity · Closed
- Matching Monomial Fibersstructural-affinity · Closed
- Matching Polynomial Formulastructural-affinity · Closed
- PentagonMissingEdgeObstructionstructural-affinity · Closed
- Rectangular Convolution at Alpha Minus One Halfstructural-affinity · Closed
- The extremal matching number for odd degreesstructural-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