Combinatorics / CONCEPT
De–Patra Conjecture 2.9
Contraction of any bridge whose two deletion components each have at least two vertices, followed by addition of one fresh leaf, strictly increases the sum of eccentric connected vertex-and-edge subgraph counts.
Closed
DIRECT PREREQUISITES1
DIRECT CONSEQUENCES0
PROOF DEPTH3
DOCUMENT LINKS0
The original endpoint minima
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
- Connected Subgraph Counts at a Bridgestructural-affinity · Closed
- Minimal bipartite Erdős–Gyárfás counterexamples have no bridgestructural-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