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
Asymptotics for the Tur\'an number of Berge-$K_{2,t}$
TL;DR: In this paper, it was shown that the Turan number of Berge-K-2-t vertices in a family of graphs is the maximum possible number of edges that can be replaced by a hyperedge containing it.
29
On approximate horn formula minimization
Amitava Bhattacharya,Bhaskar DasGupta,Dhruv Mubayi,György Turán +3 more
- 06 Jul 2010
TL;DR: A 2log1-e(n)-inapproximability result is proven, which is the first inapproxIMability result for this problem, and a Steiner-minimization of Horn formulas is shown to be MAX-SNP-hard.
Short proofs of some extremal results II
TL;DR: In this article, the authors prove several results from different areas of extremal combinatorics, including complete or partial solutions to a number of open problems, coming mainly from extremal graph theory and Ramsey theory.
On some applications of graph theory to geometry
TL;DR: In this article, it was shown that the maximum number of times a given distance r can occur among points of a set Pn( k) of n distinct points in k-dimensional Euclidean space has a diameter dk(n, r).
28
Testing satisfiability
Noga Alon,Asaf Shapira +1 more
- 01 Jul 2003
TL;DR: In this paper, it was shown that a set of general boolean functions on n variables, such that each function depends on exactly k variables, and each variable can take a value from [1, d] is e-far from satisfiable, if one must remove at least enk functions in order to make the remaining functions satisfiable.