Theorems · Theorem · combinatorics
SimpleGraph.IsBipartite.four_mul_encard_edgeSet_le
∀ {V : Type u_1} {G : SimpleGraph V}, G.IsBipartite → 4 * G.edgeSet.encard ≤ ENat.card V ^ 2- Cited by
- 0 results in Mathlib
- Foundations
- Depth 99 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites27
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Setproof · cited by 53,352
- ENatstatement and proof · cited by 4,985
- SimpleGraphstatement and proof · cited by 3,072
- Finiteproof · cited by 3,029
- le_reflproof · cited by 2,061
- Nat.cardproof · cited by 844
- Sym2statement · cited by 737
- le_imp_le_of_le_of_leproof · cited by 576
- Infiniteproof · cited by 352
- Set.ncardproof · cited by 344
- Set.encardstatement and proof · cited by 327
- mul_le_mul'proof · cited by 274
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.