Theorems · Theorem · combinatorics
SimpleGraph.mulCayley_le_iff
∀ {M : Type u_1} (s : Set M) [inst : Mul M] (G : SimpleGraph M),
SimpleGraph.mulCayley s ≤ G ↔ ∀ g ∈ s, ∀ (a : M), a * g ≠ a → G.Adj (a * g) a- Defined in
- Mathlib.Combinatorics.SimpleGraph.Cayley
- Cited by
- 0 results in Mathlib
- Foundations
- Depth 15 from the axioms · uses propext, Quot.sound
- Assumes
- Mul
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.
- Setstatement and proof · cited by 53,352
- SimpleGraphstatement and proof · cited by 3,072
- SimpleGraph.Adjstatement and proof · cited by 1,346
- SimpleGraph.Adj.symmproof · cited by 66
- SimpleGraph.mulCayleystatement · cited by 15
- SimpleGraph.le_iff_adjproof · cited by 2
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.