Skip to search formSkip to main contentSkip to account menu

Zarankiewicz problem

Known as: Kővári-Sós-Turán theorem, Kövari–Sós–Turán theorem, Kővari-Sós-Turán theorem 
The Zarankiewicz problem, an unsolved problem in mathematics, asks for the largest possible number of edges in a bipartite graph that has a given… 
Wikipedia (opens in a new tab)

Related topics

Related topics

13 relations
Bipartite double coverDegree (graph theory)Digital geometryErdős–Stone theorem

Broader (1)

Extremal graph theory

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Cycles of Even Lengths in Graphs
We see that this gives a better upper bound than that obtained by excluding Kk,k, best known to be O(n2−1/k) from the… 
Review
2015
Review
2015
6-Dependent Random Choice
If F is a family of graphs containing a bipartite graph, then for some δ > 0, ex(n,F) < n2−δ by the Kövari-Sós-Turán Theorem. Erd… 
2014
2014
Strong Jumps and Lagrangians of Non-Uniform Hypergraphs
The hypergraph jump problem and the study of Lagrangians of uniform hypergraphs are two classical areas of study in the extremal… 
2012
2012
An Algorithmic Approach for the Zarankiewicz Problem
2009
2009
Publikációk Listája Hajnal Péter Megjelent [1] Partition of graphs with condition on the connectivity and minimum degree, COMBINATORICA,
[1] Partition of graphs with condition on the connectivity and minimum degree, COMBINATORICA, 3 (1983), 95-99. [2] Gráfok partici… 
2000
2000
The Zarankiewicz problem via Chow formsMarko
The well-known Zarankiewicz problem Za] asks to determine the least positive integer 
1989
1989
Moment-preserving spline approximation on finite intervals and Turán quadratures.
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)