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
  • 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. 

    References

    SHOWING 1-10 OF 26 REFERENCES
    Norm-graphs and bipartite turán numbers
    • 137
    • Highly Influential
    More on the extremal number of subdivisions
    • 15
    • PDF
    Norm-Graphs: Variations and Applications
    • 161
    • Highly Influential
    • PDF
    On discrepancy bounds via dual shatter function
    • 9
    • Highly Influential
    • PDF
    Graphs with few paths of prescribed length between any two vertices
    • 26
    • PDF
    On Turán exponents of bipartite graphs
    • 11
    • PDF
    Turán numbers for Ks, t-free graphs: topological obstructions and algebraic constructions
    • 17