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
The Zarankiewicz problem in 3‐partite graphs
Let F be a graph, k ≥ 2 be an integer, and write ex χ ≤ k ( n , F ) for the maximum number of edges in an n ‐vertex graph that is… 
2016
2016
Cutting lemma and Zarankiewicz’s problem in distal structures
We establish a cutting lemma for definable families of sets in distal structures, as well as the optimality of the distal cell… 
2015
2015
Maxima of the Q-index: graphs with no K_s,t
Highly Cited
2009
Highly Cited
2009
Spectral Extrema for Graphs: The Zarankiewicz Problem
Let $G$ be a graph on $n$ vertices with spectral radius $\lambda$ (this is the largest eigenvalue of the adjacency matrix of $G… 
2005
2005
The Turán Problem for Hypergraphs of Fixed Size
We obtain a general bound on the Turan density of a hypergraph in terms of the number of edges that it contains. If ${\cal F}$ is… 
2002
2002
The Zarankiewicz Problem via Chow Forms
The well-known Zarankiewicz problem [Za] is to determine the least positive integer Z(m;n;r;s) such that each m £ n 0-1 matrix… 
2002
2002
Computational Problems that can be Solved Without Computation
The paper discusses various optimization problems that look fairly difficult at first sight, but in fact are trivial to solve… 
Highly Cited
1996
Highly Cited
1996
An Upper Bound on Zarankiewicz' Problem
Let ex(n, K3,3) denote the maximum number of edges of a K3,3-free graph on n vertices. Improving earlier results of Kővári, T. S… 
1995
1995
The maximal number of inducedr-partite subgraphs
In this paper, we extend earlier results concerning the maximal number of induced completer-partite graphs in a graphG of ordern… 
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)