Mathlib Map

Theorems · Theorem · combinatorics

SimpleGraph.circulantGraph_adj_translate

∀ {G : Type u_1} [inst : AddGroup G] {s : Set G} {u v d : G},
  (SimpleGraph.circulantGraph s).Adj (u + d) (v + d) ↔ (SimpleGraph.circulantGraph s).Adj u v
Defined in
Mathlib.Combinatorics.SimpleGraph.Circulant
Cited by
0 results in Mathlib
Foundations
Depth 13 from the axioms · uses propext, Quot.sound
Assumes
AddGroup
Mathlib docsSourceLoogleLeanSearch

Around this declaration

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

Set · cited by 53352SetAddGroup · cited by 4410AddGroupSimpleGraph.Adj · cited by 1346SimpleGraph.Adjadd_sub_add_right_eq_sub · cited by 29add_sub_add_right_eq_subSimpleGraph.circulantGraph · cited by 5SimpleGraph.circulantGraphSimpleGraph.circulantGraph_adj · cited by 3SimpleGraph.circulantGrap…SimpleGraph.circulantGraph_ad…CITED BYCITES

Cites6

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.