Theorems · Theorem · combinatorics
SimpleGraph.extend_finset_to_connected
∀ {V : Type u} {G : SimpleGraph V},
G.Preconnected → ∀ {t : Finset V}, t.Nonempty → ∃ t', t ⊆ t' ∧ (SimpleGraph.induce (↑t') G).Connected- Cited by
- 0 results in Mathlib
- Foundations
- Depth 77 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites23
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Finsetstatement and proof · cited by 13,712
- SetLike.coestatement and proof · cited by 8,199
- Set.Elemstatement · cited by 7,166
- Set.ofPredproof · cited by 6,101
- SimpleGraphstatement and proof · cited by 3,072
- Set.iUnionproof · cited by 2,483
- Finset.Nonemptystatement and proof · cited by 1,001
- Set.iUnion_congr_Propproof · cited by 374
- Nonempty.someproof · cited by 340
- SimpleGraph.Walk.supportproof · cited by 307
- Finset.biUnionproof · cited by 217
- SimpleGraph.Reachableproof · cited by 141
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.