Combinatorics / CONCEPT
Native Bridge and Pendant Counting
Actual connected vertex-and-edge subgraphs give the bridge and pendant counting identities. Every non-endpoint eccentricity strictly increases under the bridge shift, including comparison against the fresh-leaf target.
Closed
DIRECT PREREQUISITES1
DIRECT CONSEQUENCES2
PROOF DEPTH2
DOCUMENT LINKS0
Separate the singleton pendant vertex
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 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
- Minimal bipartite Erdős–Gyárfás counterexamples have no bridgestructural-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