Theorems · Theorem · combinatorics
SimpleGraph.Connected.exists_isPath
∀ {V : Type u} {G : SimpleGraph V}, G.Connected → ∀ (u v : V), ∃ p, p.IsPath- Cited by
- 4 results in Mathlib
- Foundations
- Depth 30 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites6
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.Walkstatement · cited by 915
- SimpleGraph.Walk.IsPathstatement · cited by 140
- SimpleGraph.Connectedstatement and proof · cited by 75
- SimpleGraph.Connected.preconnectedproof · cited by 28
- SimpleGraph.Reachable.exists_isPathproof · cited by 4
Cited by4
Results whose statement or proof uses this declaration.
- SimpleGraph.Connected.connected_delete_edge_of_not_isBridgeproof · cited by 2
- SimpleGraph.Connected.induce_compl_singleton_of_degree_eq_oneproof · cited by 1
- SimpleGraph.isTree_iff_minimal_connectedproof · cited by 0
- SimpleGraph.IsTree.exists_ne_and_degree_eq_oneproof · cited by 0