Combinatorics / CONCEPT
HaggkvistPentagonHomomorphism
Finite graph structure, degree counting, and perfect matchings.
Closed
DIRECT PREREQUISITES1
DIRECT CONSEQUENCES1
PROOF DEPTH1
DOCUMENT LINKS0
surjective of not two color
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 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
- Matching Monomial Fibersstructural-affinity · Closed
- PentagonMissingEdgeObstructionstructural-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