Theorems · Definition · combinatorics
SimpleGraph.EdgeDisjointTriangles
{α : Type u_1} → SimpleGraph α → PropA graph has edge-disjoint triangles if each edge belongs to at most one triangle.
- Cited by
- 8 results in Mathlib
- Foundations
- Depth 54 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.
- Finsetproof · cited by 13,712
- SetLike.coeproof · cited by 8,199
- SimpleGraphstatement and proof · cited by 3,072
- Set.Pairwiseproof · cited by 321
- Set.Subsingletonproof · cited by 276
- SimpleGraph.cliqueSetproof · cited by 18
Cited by9
Results whose statement or proof uses this declaration.
- SimpleGraph.LocallyLinearproof · cited by 9
- SimpleGraph.LocallyLinear.edgeDisjointTrianglesstatement · cited by 1
- SimpleGraph.edgeDisjointTriangles_iff_mem_sym2_subsingletonstatement and proof · cited by 1
- SimpleGraph.EdgeDisjointTriangles.card_edgeFinset_lestatement and proof · cited by 1
- SimpleGraph.EdgeDisjointTriangles.mapstatement and proof · cited by 1
- SimpleGraph.EdgeDisjointTriangles.mem_sym2_subsingletonstatement · cited by 1
- SimpleGraph.edgeDisjointTriangles_botstatement · cited by 0
- SimpleGraph.EdgeDisjointTriangles.farFromTriangleFreestatement and proof · cited by 0
- SimpleGraph.EdgeDisjointTriangles.monostatement and proof · cited by 0