On a problem of K. Zarankiewicz
T. Kóvari,V. T. Sós,Paul Turán +2 more
About: This article is published in Colloquium Mathematicum. The article was published on 01 Jan 1954. and is currently open access. The article focuses on the topics: Extremal combinatorics & Zarankiewicz problem.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
•Posted Content
Harary polynomials.
TL;DR: This paper investigates properties of Harary polynomials and compares them with properties of the classical chromatic polynomial $\chi(G;k)", and shows that for various notions of sparse, non-trivial properties $\mathcal{P}$, the polynometric is not a chromatic, and even not an edge elimination invariant.
4
•Posted Content
Dense induced subgraphs of dense bipartite graphs.
TL;DR: In this article, it was shown that every bipartite graph of sufficiently large average degree has either a k-subgraph or an induced subgraph of average degree at least k and girth at least 6.
4
The Uniformity Conjecture in Additive Combinatorics
Ilya D. Shkredov,József Solymosi +1 more
TL;DR: In this paper, the authors show examples for applications of the Bombieri-Lang conjecture in additive combinatorics, giving bounds on the cardinality of sumsets of squares and higher powers of integers.
Bipartite Ramsey numbers of Kt,s in many colors
Ye Wang,Yusheng Li,Yan Li +2 more
TL;DR: It is shown that b r k ( K 2, s) ∼ ( s − 1 ) k 2 for fixed s ≥ 2 and b rK ( K 3, 3 ) ∼ k 3 as k → ∞ .
4
•Posted Content
Stability results on vertex Turán problems in Kneser graphs
Dániel Gerbner,Abhishek Methuku,Dániel T. Nagy,Balázs Patkós,Máté Vizer +4 more
- 12 Apr 2018
TL;DR: In this article, the second largest vertex set of the Kneser graph is shown to be Ω(n,k)-free when the chromatic number of the graph is larger than 2.
4