Theorems · Theorem · combinatorics
SimpleGraph.Walk.tail_cons
∀ {V : Type u} {G : SimpleGraph V} {u v w : V} (h : G.Adj u v) (p : G.Walk v w),
(SimpleGraph.Walk.cons h p).tail = p.copy ⋯ ⋯- Cited by
- 9 results in Mathlib
- Foundations
- Depth 12 from the axioms · uses no axioms
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites9
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.Adjstatement and proof · cited by 1,346
- SimpleGraph.Walkstatement and proof · cited by 915
- SimpleGraph.Walk.getVertstatement · cited by 114
- SimpleGraph.Walk.casesOnproof · cited by 59
- SimpleGraph.Walk.sndstatement · cited by 56
- SimpleGraph.Walk.copystatement · cited by 56
- SimpleGraph.Walk.getVert_zerostatement · cited by 43
- SimpleGraph.Walk.tailstatement and proof · cited by 34
Cited by9
Results whose statement or proof uses this declaration.
- SimpleGraph.Walk.getVert_tailproof · cited by 5
- SimpleGraph.Walk.cons_tail_eqproof · cited by 5
- SimpleGraph.Walk.IsPath.eq_snd_of_mem_edgesproof · cited by 3
- SimpleGraph.Walk.IsPath.tailproof · cited by 2
- SimpleGraph.Walk.length_tailproof · cited by 2
- SimpleGraph.Walk.isCycle_iff_isPath_tail_and_le_lengthproof · cited by 1
- SimpleGraph.Walk.IsHamiltonianCycle.mapproof · cited by 1
- SimpleGraph.Walk.tail_support_perm_dropLast_supportproof · cited by 1
- SimpleGraph.Walk.reverse_tailproof · cited by 0