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
The Ramsey number of dense graphs
TL;DR: In this article, it was shown that the Ramsey number of graphs with t vertices and density ρ ≤ 2 √ ρ, which is the smallest number n such that, in any two-colouring of the edges of Kn, there is a monochromatic copy of H.
Convex Polygons Made from Few Lines and Convex Decompositions of Polyhedra
John Hershberger,Jack Snoeyink +1 more
- 08 Jul 1992
TL;DR: It is shown that Chazelle's notch-cutting procedure, when applied to a polyhedron with n faces and r reflex dihedral angles, gives a convex decomposition with Θ(nr+r7/3) worst-case complexity.
14
Ramsey Problems with Bounded Degree Spread
Guantao Chen,Richard H. Schelp +1 more
TL;DR: In this paper, the authors studied bipartite graphs G such that, for n sufficiently large, each two-coloring of the edges of the complete graph Kn gives a monochromatic copy of G, with some k of its vertices having the maximum degree of these k vertices minus the minimum degree of the vertices (in the colored Kn) at most k − 2.
14
Approximation and Hardness: Beyond P and NP
Pasin Manurangsi
- 01 Jan 2019
TL;DR: Manurangsi et al. as mentioned in this paper provided hardness of approximation results for the following problems: Dense Constraint Satisfaction Problems (CSPs), Densest k-Subgraph with perfect completeness, VC Dimension, and Littlestone's Dimension.
In absence of long chordless cycles, large tree-width becomes a local phenomenon
TL;DR: It is proved that, for all $\ell$ and $s$, every graph of sufficiently large tree-width contains either a complete bipartite graph $K_{s,s}$ or a chordless cycle of length greater than $\ell$.
14