Theorems · Inductive type · combinatorics
Graph.Simple
{α : Type u_1} → {β : Type u_2} → Graph α β → PropA Simple graph is a Loopless graph where no pair of vertices are the ends of more than one
edge.
- Defined in
- Mathlib.Combinatorics.Graph.Simple
- Cited by
- 4 results in Mathlib
- Foundations
- Depth 1 from the axioms · 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.
- Graphstatement · cited by 242
Cited by6
Results whose statement or proof uses this declaration.
- Graph.IsLink.eqstatement and proof · cited by 1
- Graph.Simple.casesOnstatement and proof · cited by 1
- Graph.Simple.eq_of_isLinkstatement and proof · cited by 1
- Graph.simple_iffstatement and proof · cited by 0
- Graph.Simple.antistatement and proof · cited by 0
- Graph.Simple.recOnstatement and proof · cited by 0