Theorems · Definition · combinatorics
SimpleGraph.Adj
{V : Type u} → SimpleGraph V → V → V → PropThe adjacency relation of a simple graph.
- Defined in
- Mathlib.Combinatorics.SimpleGraph.Basic
- Cited by
- 1,346 results in Mathlib
- Foundations
- Depth 1 from the axioms, rests on 2 definitions · uses no axioms
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites1
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
Cited by1,488
Results whose statement or proof uses this declaration.
- SimpleGraph.neighborSetproof · cited by 257
- SimpleGraph.Homproof · cited by 139
- SimpleGraph.Isoproof · cited by 99
- SimpleGraph.IsCliqueproof · cited by 76
- SimpleGraph.Walk.mapstatement · cited by 66
- SimpleGraph.Adj.symmstatement and proof · cited by 66
- SimpleGraph.extstatement and proof · cited by 59
- SimpleGraph.Walk.casesOnstatement and proof · cited by 59
- SimpleGraph.mapproof · cited by 49
- SimpleGraph.adjMatrixstatement and proof · cited by 48
- SimpleGraph.sumproof · cited by 46
- SimpleGraph.Walk.getVert_zeroproof · cited by 43
Showing the 200 most cited of 1,488.