Combinatorics / CONCEPT
Minimal bipartite Erdős–Gyárfás counterexamples have no bridge
A minimal bipartite graph of minimum degree at least three without a power-of-two cycle is connected and has no bridge.
Closed
DIRECT PREREQUISITES1
DIRECT CONSEQUENCES0
PROOF DEPTH1
DOCUMENT LINKS0
Minimal counterexamples are connected
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
- A Path Hull Without Cut Verticesstructural-affinity · Closed
- Bridge Contraction in Bipartite Graphsstructural-affinity · Closed
- Connected Subgraph Counts at a Bridgestructural-affinity · Closed
- De–Patra Conjecture 2.9structural-affinity · Closed
- Native Bridge and Pendant Countingstructural-affinity · Closed
- The Subgraph Core and Native Blocksstructural-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