Mathlib Map

Theorems · Definition · combinatorics

Graph.toSimpleGraph

{α : Type u_1} → {β : Type u_2} → (G : Graph α β) → SimpleGraph ↑G.vertexSet

Construct a simple graph from a graph.

Defined in
Mathlib.Combinatorics.Graph.Simple
Cited by
3 results in Mathlib
Foundations
Depth 16 from the axioms · uses propext, Classical.choice, Quot.sound

Around this declaration

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

Cites5

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

Cited by4

Results whose statement or proof uses this declaration.