Theorems · Theorem · combinatorics
SimpleGraph.Walk.finite_neighborSet_toSubgraph
∀ {V : Type u} {G : SimpleGraph V} {u v w : V} (p : G.Walk u v), (p.toSubgraph.neighborSet w).Finite- Cited by
- 1 results in Mathlib
- Foundations
- Depth 66 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites14
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Setproof · cited by 53,352
- SimpleGraphstatement and proof · cited by 3,072
- Set.Finitestatement and proof · cited by 1,814
- SimpleGraph.Adjproof · cited by 1,346
- SimpleGraph.Walkstatement and proof · cited by 915
- SimpleGraph.Subgraphproof · cited by 326
- Set.Finite.subsetproof · cited by 285
- Set.toFiniteproof · cited by 174
- Set.Finite.unionproof · cited by 74
- SimpleGraph.Walk.toSubgraphstatement and proof · cited by 49
- SimpleGraph.Subgraph.neighborSetstatement and proof · cited by 46
- SimpleGraph.Subgraph.neighborSet_supproof · cited by 1
Cited by1
Results whose statement or proof uses this declaration.
- SimpleGraph.Walk.IsCycle.adj_toSubgraph_iff_of_isCyclesproof · cited by 0