Corpus ID: 220793154

Some remarks on the Zarankiewicz problem

@article{Conlon2020SomeRO,
  title={Some remarks on the Zarankiewicz problem},
  author={D. Conlon},
  journal={arXiv: Combinatorics},
  year={2020}
}

D. Conlon

Published 2020

Mathematics

arXiv: Combinatorics

View PDF on arXiv

Save to Library

Create Alert

Cite

Launch Research Feed

The Zarankiewicz problem asks for an estimate on z(m,n;s,t), the largest number of 1's in an m×n matrix with all entries 0 or 1 containing no s×t submatrix consisting entirely of 1's. We show that a classical upper bound for z(m,n;s,t) due to Kővari, Sos and Turan is tight up to the constant for a broad range of parameters. The proof relies on a new quantitative variant of the random algebraic method.