Mathlib Map

Theorems · Theorem · combinatorics

SimpleGraph.Walk.length_bypass_le_length

∀ {V : Type u} {G : SimpleGraph V} {u v : V} [inst : DecidableEq V] (p : G.Walk u v), p.bypass.length ≤ p.length
Defined in
Mathlib.Combinatorics.SimpleGraph.Paths
Cited by
1 results in Mathlib
Foundations
Depth 73 from the axioms · uses propext, Classical.choice, Quot.sound
Assumes
DecidableEq
Mathlib docsSourceLoogleLeanSearch

Around this declaration

Dashed lines are statement dependencies; solid lines are citations in proofs.

SimpleGraph.Walk.length_bypass_le · cited by 0Walk.length_bypass_leSimpleGraph · cited by 3072SimpleGraphSimpleGraph.Walk · cited by 915SimpleGraph.WalkSimpleGraph.Walk.length · cited by 212Walk.lengthSimpleGraph.Walk.bypass · cited by 20Walk.bypassSimpleGraph.Walk.length_darts · cited by 9Walk.length_dartsSimpleGraph.Walk.darts_bypass_sublist_darts · cited by 4Walk.darts_bypass_sublist…Walk.length_bypass_le_lengthCITED BYCITES

Cites6

Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.

Cited by1

Results whose statement or proof uses this declaration.