Mathlib Map

Theorems · Definition · combinatorics

SimpleGraph.fromRel

{V : Type u} → (V → V → Prop) → SimpleGraph V

Construct the simple graph induced by the given relation. It symmetrizes the relation and makes it irreflexive.

Defined in
Mathlib.Combinatorics.SimpleGraph.Basic
Cited by
3 results in Mathlib
Foundations
Depth 10 from the axioms · uses propext, Quot.sound
Mathlib docsSourceLoogleLeanSearch

Around this declaration

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

SimpleGraph.mulCayley · cited by 15SimpleGraph.mulCayleySimpleGraph.addCayley · cited by 15SimpleGraph.addCayleySimpleGraph.starGraph · cited by 10SimpleGraph.starGraphSimpleGraph.circulantGraph · cited by 5SimpleGraph.circulantGraphSimpleGraph.addCayley_adj' · cited by 4SimpleGraph.addCayley_adj'Digraph.toSimpleGraphInclusive · cited by 4Digraph.toSimpleGraphIncl…SimpleGraph.fromRel_adj · cited by 1SimpleGraph.fromRel_adjSimpleGraph.mulCayley_adj' · cited by 0SimpleGraph.mulCayley_adj'SimpleGraph · cited by 3072SimpleGraphSimpleGraph.fromRelCITED BYCITES

Cites1

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

Cited by8

Results whose statement or proof uses this declaration.