Theorems · Definition · combinatorics
SimpleGraph.zarankiewicz
ℕ → ℕ → ℕ → ℕ → ℕ
The Zarankiewicz function of natural numbers m, n, s, and t is the maximum
number of edges in a completeBipartiteGraph (Fin s) (Fin t)-free bipartite graph with parts of
size m and n.
This is the extremal graph theory version of the Zarankiewicz function.
- Cited by
- 7 results in Mathlib
- Foundations
- Depth 73 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites8
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Finset.univproof · cited by 3,473
- SimpleGraphproof · cited by 3,072
- Finset.cardproof · cited by 2,327
- Finset.filterproof · cited by 949
- Finset.supproof · cited by 530
- SimpleGraph.edgeFinsetproof · cited by 116
- SimpleGraph.Freeproof · cited by 39
- completeBipartiteGraphproof · cited by 16
Cited by7
Results whose statement or proof uses this declaration.
- SimpleGraph.zarankiewicz_of_fintypeCard_eqstatement · cited by 2
- SimpleGraph.zarankiewicz_le_iffstatement · cited by 1
- SimpleGraph.lt_zarankiewicz_iffstatement · cited by 1
- SimpleGraph.zarankiewicz_le_extremalNumberstatement and proof · cited by 0
- SimpleGraph.zarankiewicz_le_iff_of_nonnegstatement and proof · cited by 0
- SimpleGraph.two_mul_extremalNumber_le_zarankiewicz_symmstatement and proof · cited by 0
- SimpleGraph.lt_zarankiewicz_iff_of_nonnegstatement and proof · cited by 0