Theorems · Definition · combinatorics
Graph.toSimpleGraph
{α : Type u_1} → {β : Type u_2} → (G : Graph α β) → SimpleGraph ↑G.vertexSetConstruct 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.
- Set.Elemstatement and proof · cited by 7,166
- SimpleGraphstatement · cited by 3,072
- Graphstatement and proof · cited by 242
- Graph.vertexSetstatement and proof · cited by 87
- Graph.Adjproof · cited by 23
Cited by4
Results whose statement or proof uses this declaration.
- Graph.toSimpleGraph_adjstatement and proof · cited by 1
- Graph.toSimpleGraph_adj_iffstatement · cited by 0
- Graph.toSimpleGraph_monostatement and proof · cited by 0
- Graph.toSimpleGraphOfSimpleGraphIsostatement · cited by 0