Theorems · Definition · combinatorics
SimpleGraph.LocallyLinear
{α : Type u_1} → SimpleGraph α → PropA graph is locally linear if each edge belongs to exactly one triangle.
- Cited by
- 9 results in Mathlib
- Foundations
- Depth 55 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.
- Finsetproof · cited by 13,712
- SimpleGraphstatement and proof · cited by 3,072
- SimpleGraph.Adjproof · cited by 1,346
- SimpleGraph.IsNCliqueproof · cited by 64
- SimpleGraph.EdgeDisjointTrianglesproof · cited by 8
Cited by10
Results whose statement or proof uses this declaration.
- ruzsaSzemerediNumberproof · cited by 8
- SimpleGraph.LocallyLinear.mapstatement and proof · cited by 2
- ruzsaSzemerediNumber_monoproof · cited by 2
- SimpleGraph.LocallyLinear.edgeDisjointTrianglesstatement · cited by 1
- SimpleGraph.LocallyLinear.le_ruzsaSzemerediNumberstatement and proof · cited by 1
- SimpleGraph.locallyLinear_botstatement · cited by 1
- SimpleGraph.LocallyLinear.card_edgeFinsetstatement and proof · cited by 0
- ruzsaSzemerediNumber_specstatement · cited by 0
- SimpleGraph.locallyLinear_comapstatement and proof · cited by 0
- SimpleGraph.TripartiteFromTriangles.locallyLinearstatement · cited by 0