Theorems · Theorem · combinatorics
SimpleGraph.Connected.sum_sup_edge
∀ {V : Type u_3} {W : Type u_5} {G : SimpleGraph V} {H : SimpleGraph W} {v : V} {w : W},
G.Connected → H.Connected → ((G ⊕g H) ⊔ SimpleGraph.edge (Sum.inl v) (Sum.inr w)).Connected- Defined in
- Mathlib.Combinatorics.SimpleGraph.Sum
- Cited by
- 0 results in Mathlib
- Foundations
- Depth 63 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites8
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- SimpleGraphstatement and proof · cited by 3,072
- SimpleGraph.Connectedstatement and proof · cited by 75
- SimpleGraph.Preconnectedproof · cited by 49
- SimpleGraph.sumstatement · cited by 46
- SimpleGraph.edgestatement · cited by 44
- SimpleGraph.Connected.preconnectedproof · cited by 28
- SimpleGraph.Connected.casesOnproof · cited by 2
- SimpleGraph.Preconnected.sum_sup_edgeproof · cited by 1
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.