Theorems · Theorem · combinatorics
SimpleGraph.Walk.cons_tail_eq
∀ {V : Type u} {G : SimpleGraph V} {u v : V} (p : G.Walk u v) (hp : ¬p.Nil), SimpleGraph.Walk.cons ⋯ p.tail = p- Cited by
- 5 results in Mathlib
- Foundations
- Depth 24 from the axioms · uses propext
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites13
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.Nilstatement and proof · cited by 102
- SimpleGraph.Walk.casesOnproof · cited by 59
- SimpleGraph.Walk.sndstatement · cited by 56
- SimpleGraph.Walk.copyproof · cited by 56
- SimpleGraph.Walk.getVert_zeroproof · cited by 43
- SimpleGraph.Walk.tailstatement and proof · cited by 34
- SimpleGraph.Walk.cons.congr_simpproof · cited by 15
- SimpleGraph.Walk.adj_sndstatement and proof · cited by 15
- SimpleGraph.Walk.tail_consproof · cited by 9
Cited by5
Results whose statement or proof uses this declaration.
- SimpleGraph.Walk.support_tail_of_not_nilproof · cited by 11
- SimpleGraph.Walk.IsCycle.getVert_injOnproof · cited by 4
- SimpleGraph.Walk.length_tail_add_oneproof · cited by 4
- SimpleGraph.Walk.IsPath.eq_snd_of_mem_edgesproof · cited by 3
- SimpleGraph.IsAcyclic.isPath_iff_isChainproof · cited by 1