Theorems · Theorem · combinatorics
SimpleGraph.Reachable.refl
∀ {V : Type u} {G : SimpleGraph V} (u : V), G.Reachable u u- Cited by
- 10 results in Mathlib
- Foundations
- Depth 3 from the axioms · uses no axioms
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites2
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.Reachablestatement · cited by 141
Cited by10
Results whose statement or proof uses this declaration.
- SimpleGraph.Reachable.rflproof · cited by 4
- SimpleGraph.reachable_iff_reflTransGenproof · cited by 3
- SimpleGraph.Subgraph.subgraphOfAdj_connectedproof · cited by 3
- SimpleGraph.Reachable.of_subsingletonproof · cited by 2
- SimpleGraph.ConnectedComponent.Represents.exists_inter_eq_singletonproof · cited by 2
- SimpleGraph.ConnectedComponent.supp_injectiveproof · cited by 2
- SimpleGraph.ComponentCompl.supp_injectiveproof · cited by 2
- SimpleGraph.reachable_is_equivalenceproof · cited by 0
- SimpleGraph.preconnected_topproof · cited by 0
- SimpleGraph.IsHamiltonian.connectedproof · cited by 0