Theorems · Theorem · combinatorics
SimpleGraph.FarFromTriangleFree.lt_one
∀ {α : Type u_1} {𝕜 : Type u_3} [inst : Field 𝕜] [inst_1 : LinearOrder 𝕜] [IsStrictOrderedRing 𝕜] {G : SimpleGraph α}
{ε : 𝕜} [inst_3 : Fintype α] [inst_4 : DecidableRel G.Adj] [Nonempty α], G.FarFromTriangleFree ε → ε < 1- Cited by
- 1 results in Mathlib
- Foundations
- Depth 85 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites10
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- LinearOrderstatement and proof · cited by 8,572
- Fintypestatement and proof · cited by 7,736
- Fieldstatement and proof · cited by 7,404
- SimpleGraphstatement and proof · cited by 3,072
- IsStrictOrderedRingstatement and proof · cited by 2,490
- SimpleGraph.Adjstatement and proof · cited by 1,346
- LT.lt.transproof · cited by 370
- SimpleGraph.FarFromTriangleFreestatement and proof · cited by 15
- two_inv_lt_oneproof · cited by 3
- SimpleGraph.FarFromTriangleFree.lt_halfproof · cited by 1
Cited by1
Results whose statement or proof uses this declaration.
- SimpleGraph.FarFromTriangleFree.le_card_cliqueFinsetproof · cited by 2