Theorems · Definition · combinatorics
SimpleGraph.Walk.tail
{V : Type u} → {G : SimpleGraph V} → {u v : V} → (p : G.Walk u v) → G.Walk p.snd vThe walk obtained by removing the first dart of a walk. A nil walk stays nil.
- Cited by
- 34 results in Mathlib
- Foundations
- Depth 11 from the axioms · uses no axioms
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites4
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 and proof · cited by 915
- SimpleGraph.Walk.sndstatement · cited by 56
- SimpleGraph.Walk.dropproof · cited by 30
Cited by36
Results whose statement or proof uses this declaration.
- SimpleGraph.Walk.support_tail_of_not_nilstatement and proof · cited by 11
- SimpleGraph.Walk.tail_consstatement and proof · cited by 9
- SimpleGraph.Walk.IsHamiltonianCycle.isHamiltonian_tailstatement · cited by 7
- SimpleGraph.Walk.cons_tail_eqstatement and proof · cited by 5
- SimpleGraph.Walk.getVert_tailstatement · cited by 5
- SimpleGraph.Walk.IsCycle.getVert_injOnproof · cited by 4
- SimpleGraph.Walk.IsCycle.isPath_tailstatement · cited by 4
- SimpleGraph.Walk.length_tail_add_onestatement and proof · cited by 4
- SimpleGraph.isAcyclic_iff_subsingleton_pathproof · cited by 3
- SimpleGraph.IsTree.card_edgeFinsetproof · cited by 3
- SimpleGraph.Walk.IsPath.eq_snd_of_mem_edgesproof · cited by 3
- SimpleGraph.Walk.cons_support_tailstatement · cited by 2