Theorems · Theorem · combinatorics
Graph.toSimpleGraph_adj
∀ {α : Type u_1} {β : Type u_2} (G : Graph α β) (u v : ↑G.vertexSet), G.toSimpleGraph.Adj u v = (u ≠ v ∧ G.Adj ↑u ↑v)- Defined in
- Mathlib.Combinatorics.Graph.Simple
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 17 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites7
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Setstatement · cited by 53,352
- Set.Elemstatement and proof · cited by 7,166
- SimpleGraph.Adjstatement and proof · cited by 1,346
- Graphstatement and proof · cited by 242
- Graph.vertexSetstatement and proof · cited by 87
- Graph.Adjstatement · cited by 23
- Graph.toSimpleGraphstatement and proof · cited by 3
Cited by1
Results whose statement or proof uses this declaration.
- Graph.toSimpleGraph_monoproof · cited by 0