Combinatorics / CONCEPT
PentagonMissingEdgeObstruction
Finite graph structure, degree counting, and perfect matchings.
Closed
DIRECT PREREQUISITES0
DIRECT CONSEQUENCES2
PROOF DEPTH0
DOCUMENT LINKS0
threshold or exception
RELATIONSHIP ATLAS
Every connection, in context.
Direct recorded relationships
Proof dependencyStructural affinityDocument link
Certified topology / UPSTREAM
Prerequisites
None recorded in this release.
Certified topology / DOWNSTREAM
Consequences
RELATED KNOWLEDGE
Structural connections
- 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
- Finite Convolution Coefficientsstructural-affinity · Closed
- HaggkvistPentagonHomomorphismstructural-affinity · Closed
- Matching Monomial Fibersstructural-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