Mathlib Map

Theorems · Theorem · combinatorics

SimpleGraph.Walk.nil_rotate

∀ {V : Type u} {G : SimpleGraph V} {v u : V} [inst : DecidableEq V] {c : G.Walk v v} (h : u ∈ c.support),
  (c.rotate u h).Nil ↔ c.Nil
Defined in
Mathlib.Combinatorics.SimpleGraph.Walk.Decomp
Cited by
0 results in Mathlib
Foundations
Depth 61 from the axioms · uses propext, Quot.sound
Assumes
DecidableEq
Mathlib docsSourceLoogleLeanSearch

Around this declaration

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

SimpleGraph · cited by 3072SimpleGraphSimpleGraph.Walk · cited by 915SimpleGraph.WalkSimpleGraph.Walk.support · cited by 307Walk.supportSimpleGraph.Walk.length · cited by 212Walk.lengthSimpleGraph.Walk.Nil · cited by 102Walk.NilSimpleGraph.Walk.rotate · cited by 25Walk.rotateSimpleGraph.Walk.length_rotate · cited by 2Walk.length_rotateWalk.nil_rotateCITED BYCITES

Cites7

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

Cited by0

Results whose statement or proof uses this declaration.

Nothing cites this yet.