Theorems · Theorem · combinatorics
SimpleGraph.Walk.getVert_tail
∀ {V : Type u} {G : SimpleGraph V} {u v : V} {n : ℕ} (p : G.Walk u v), p.tail.getVert n = p.getVert (n + 1)- Cited by
- 5 results in Mathlib
- Foundations
- Depth 13 from the axioms · uses propext
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites10
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.Adjproof · cited by 1,346
- SimpleGraph.Walkstatement and proof · cited by 915
- SimpleGraph.Walk.getVertstatement and proof · cited by 114
- SimpleGraph.Walk.casesOnproof · cited by 59
- SimpleGraph.Walk.sndstatement · cited by 56
- SimpleGraph.Walk.getVert_zeroproof · cited by 43
- SimpleGraph.Walk.tailstatement · cited by 34
- SimpleGraph.Walk.tail_consproof · cited by 9
- SimpleGraph.Walk.getVert_copyproof · cited by 1
Cited by5
Results whose statement or proof uses this declaration.
- SimpleGraph.Walk.IsCycle.getVert_injOnproof · cited by 4
- SimpleGraph.cycleGraph.isPath_tail_cycleproof · cited by 1
- SimpleGraph.Walk.exists_adj_adj_not_adj_neproof · cited by 1
- SimpleGraph.exists_adj_isEdgeReachable_twoproof · cited by 1
- SimpleGraph.Walk.getVert_mem_tail_supportproof · cited by 0