Theorems · Theorem · combinatorics
Graph.ofSimpleGraph_adj_iff
∀ {α : Type u_1} {G : SimpleGraph α} (u v : α), (Graph.ofSimpleGraph G).Adj u v ↔ G.Adj u v- Defined in
- Mathlib.Combinatorics.Graph.Simple
- Cited by
- 0 results in Mathlib
- Foundations
- Depth 64 from the axioms · uses propext, Classical.choice, Quot.sound
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.
- SimpleGraphstatement and proof · cited by 3,072
- SimpleGraph.Adjstatement and proof · cited by 1,346
- Sym2statement and proof · cited by 737
- Graph.Adjstatement · cited by 23
- Graph.ofSimpleGraphstatement · cited by 4
- Graph.ofSimpleGraph_isLinkproof · cited by 1
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.