Theorems · Theorem · combinatorics
SimpleGraph.Walk.takeUntil_first
∀ {V : Type u} {G : SimpleGraph V} {v u : V} [inst : DecidableEq V] (p : G.Walk u v),
p.takeUntil u ⋯ = SimpleGraph.Walk.nil- Cited by
- 5 results in Mathlib
- Foundations
- Depth 16 from the axioms · uses propext
- Assumes
- DecidableEq
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.casesOnproof · cited by 59
- SimpleGraph.Walk.takeUntilstatement · cited by 58
- SimpleGraph.Walk.start_mem_supportstatement · cited by 9
Cited by5
Results whose statement or proof uses this declaration.
- SimpleGraph.Walk.count_support_takeUntil_eq_oneproof · cited by 1
- SimpleGraph.Walk.takeUntil_append_of_mem_leftproof · cited by 1
- SimpleGraph.Walk.nil_takeUntilproof · cited by 0
- SimpleGraph.Walk.IsCycle.isPath_takeUntilproof · cited by 0
- SimpleGraph.Walk.count_edges_takeUntil_le_oneproof · cited by 0