Theorems · Theorem · combinatorics
SimpleGraph.Walk.length_darts
∀ {V : Type u} {G : SimpleGraph V} {u v : V} (p : G.Walk u v), p.darts.length = p.length- Cited by
- 9 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.
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
- SimpleGraph.Adjproof · cited by 1,346
- SimpleGraph.Walkstatement and proof · cited by 915
- SimpleGraph.Walk.lengthstatement and proof · cited by 212
- SimpleGraph.Dartstatement · cited by 109
- SimpleGraph.Walk.dartsstatement and proof · cited by 74
Cited by9
Results whose statement or proof uses this declaration.
- SimpleGraph.Walk.length_takeUntil_le_lengthproof · cited by 4
- SimpleGraph.Walk.length_edgesproof · cited by 3
- SimpleGraph.Walk.darts_getElem_eq_getVertstatement and proof · cited by 3
- SimpleGraph.Walk.length_cycleBypass_le_lengthproof · cited by 1
- SimpleGraph.Walk.length_dropUntil_le_lengthproof · cited by 1
- SimpleGraph.Walk.length_bypass_le_lengthproof · cited by 1
- SimpleGraph.Walk.firstDart_eqproof · cited by 0
- SimpleGraph.Walk.darts_dropLastproof · cited by 0
- SimpleGraph.Walk.lastDart_eqproof · cited by 0