Mathlib Map

Theorems · Definition · combinatorics

SimpleGraph.circulantGraph

{G : Type u_1} → [AddGroup G] → Set G → SimpleGraph G

Circulant graph over additive group G with jumps s

Defined in
Mathlib.Combinatorics.SimpleGraph.Circulant
Cited by
5 results in Mathlib
Foundations
Depth 11 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.

SimpleGraph.circulantGraph_adj · cited by 3SimpleGraph.circulantGrap…SimpleGraph.cycleGraph_eq_circulantGraph · cited by 0SimpleGraph.cycleGraph_eq…SimpleGraph.circulantGraph_adj_translate · cited by 0SimpleGraph.circulantGrap…SimpleGraph.circulantGraph_eq_erase_zero · cited by 0SimpleGraph.circulantGrap…SimpleGraph.circulantGraph_eq_symm · cited by 0SimpleGraph.circulantGrap…Set · cited by 53352SetAddGroup · cited by 4410AddGroupSimpleGraph · cited by 3072SimpleGraphSimpleGraph.fromRel · cited by 3SimpleGraph.fromRelSimpleGraph.circulantGraphCITED BYCITES

Cites4

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

Cited by5

Results whose statement or proof uses this declaration.