Theorems · Theorem · combinatorics
SimpleGraph.EdgeDisjointTriangles.card_edgeFinset_le
∀ {α : Type u_1} {G : SimpleGraph α} [inst : DecidableEq α] [inst_1 : Fintype α] [inst_2 : DecidableRel G.Adj],
G.EdgeDisjointTriangles → 3 * (G.cliqueFinset 3).card ≤ G.edgeFinset.card- Cited by
- 1 results in Mathlib
- Foundations
- Depth 81 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites23
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Finsetstatement and proof · cited by 13,712
- Fintypestatement and proof · cited by 7,736
- Set.ofPredproof · cited by 6,101
- mul_oneproof · cited by 3,885
- SimpleGraphstatement and proof · cited by 3,072
- Finset.cardstatement and proof · cited by 2,327
- mul_commproof · cited by 2,262
- SimpleGraph.Adjstatement and proof · cited by 1,346
- Sym2statement and proof · cited by 737
- Sym2.mkproof · cited by 332
- SimpleGraph.edgeFinsetstatement and proof · cited by 116
- Finset.sym2proof · cited by 43
Cited by1
Results whose statement or proof uses this declaration.
- SimpleGraph.LocallyLinear.card_edgeFinsetproof · cited by 0