Theorems · Theorem · combinatorics
SimpleGraph.Walk.length_support
∀ {V : Type u} {G : SimpleGraph V} {u v : V} (p : G.Walk u v), p.support.length = p.length + 1- Cited by
- 15 results in Mathlib
- Foundations
- Depth 17 from the axioms · uses propext
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites6
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
- zero_addproof · cited by 2,366
- SimpleGraph.Adjproof · cited by 1,346
- SimpleGraph.Walkstatement and proof · cited by 915
- SimpleGraph.Walk.supportstatement and proof · cited by 307
- SimpleGraph.Walk.lengthstatement and proof · cited by 212
Cited by15
Results whose statement or proof uses this declaration.
- SimpleGraph.Walk.isSubwalk_iff_support_isInfixproof · cited by 7
- SimpleGraph.Walk.getVert_eq_support_getElemstatement · cited by 5
- SimpleGraph.Walk.getVert_eq_support_getElem?proof · cited by 4
- SimpleGraph.Walk.ext_getVert_le_lengthproof · cited by 2
- SimpleGraph.Walk.append_take_drop_eqproof · cited by 2
- SimpleGraph.Walk.IsHamiltonian.length_eqproof · cited by 2
- SimpleGraph.Walk.bypass_eq_self_of_length_le_length_bypassproof · cited by 2
- SimpleGraph.Walk.isCycle_iff_isPath_tail_and_le_lengthproof · cited by 1
- SimpleGraph.Walk.take_isSubwalk_takeproof · cited by 1
- SimpleGraph.Walk.take_takeproof · cited by 1
- SimpleGraph.Walk.IsPath.length_ltproof · cited by 1
- SimpleGraph.Walk.isHamiltonian_iff_isPath_and_length_eqproof · cited by 1