10 citations · 38 across the 54 of their papers we have counts for
7 papers · 1 filter
The extremal number of surfaces
Andrey Kupavskii, Alexandr Polyanskii, István Tomon +1
In 1973, Brown, Erdős and Sós proved that if is a 3-uniform hypergraph on vertices which contains no triangulation of the sphere, then has at most $…
Turán-type results for intersection graphs of boxes
István Tomon, Dmitriy Zakharov
In this short note, we prove the following analog of the Kővári-Sós-Turán theorem for intersection graphs of boxes. If is the intersection graph of axis-parallel boxes in $…
The extremal number of tight cycles
Benny Sudakov, István Tomon
A tight cycle in an -uniform hypergraph is a sequence of vertices such that all -tuples …
Infinite Sperner's theorem
Benny Sudakov, István Tomon, Adam Zsolt Wagner
One of the most classical results in extremal set theory is Sperner's theorem, which says that the largest antichain in the Boolean lattice has size $Θ\big(\frac{2^n}{\sq…
Erdős-Hajnal-type results for ordered paths
János Pach, István Tomon
An ordered graph is a graph with a linear ordering on its vertex set. We prove that for every positive integer , there exists a constant such that any ordered graph …
String graphs have the Erdős-Hajnal property
István Tomon
A string graph is the intersection graph of curves in the plane. We prove that there exists an absolute constant such that if is a string graph on vertices, then …
Hasse diagrams with large chromatic number
Andrew Suk, István Tomon
For every positive integer , we construct a Hasse diagram with vertices and chromatic number , which significantly improves on the previously known best construc…