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
Touching convex sets in the plane
Meir Katchalski,János Pach +1 more
TL;DR: In this paper, Helly's theorem and touching convex sets are discussed in the context of touch-versus-touching convex-set setting, and Helly and Pach's number is given.
4
Quasi-random hypergraphs and extremal problems for hypergraphs
Yury Person
- 06 Dec 2010
TL;DR: In this paper, a generalization of the result of Chung, Graham and Wilson to k-uniform hypergraphs is presented, and the so-called weak quasirandomness is studied.
4
Balanced supersaturation and Turan numbers in random graphs
Tao Jiang,Sean Longbrake +1 more
- 22 Aug 2022
TL;DR: In this paper , the authors propose a solution to solve the problem of the problem: this paper ] of "uniformity" and "uncertainty" of the solution.
4
•Posted Content
Minimum degree and the graph removal lemma
TL;DR: In this article, it was shown that if one imposes an appropriate minimum degree condition on a graph, then the graph can be a linear function of the clique removal lemma, and that the threshold for such a minimum degree requirement is linear.
4
•Posted Content
Clique minors in graphs with a forbidden subgraph
TL;DR: Recently, Dvořak and Yepremyan as discussed by the authors showed that any k-s-free graph has a clique minor of order Ω(n/\alpha(G)) √ 1+\frac{1}{10(s-2) }, where s is the independence number of vertices in the graph.
4