10 citations · 38 across the 54 of their papers we have counts for
5 papers · 1 filter
On the Turán number of ordered forests
Dániel Korándi, Gábor Tardos, István Tomon +1
An ordered graph is a simple graph with a linear order on its vertex set. The corresponding Turán problem, first studied by Pach and Tardos, asks for the maximum number $\text{…
On the Turán number of some ordered even cycles
Ervin Győri, Dániel Korándi, Abhishek Methuku +3
A classical result of Bondy and Simonovits in extremal graph theory states that if a graph on vertices contains no cycle of length then it has at most edges…
Forbidden induced subposets of given height
István Tomon
Let be a partially ordered set. The function $\mbox{La}^{\#}(n,P)$ denotes the size of the largest family that does not contain an induced copy of…
Forbidden induced subposets in the grid
István Tomon
In this short paper, we prove the following generalization of a result of Methuku and Pálvölgyi. Let be a poset, then there exists a constant with the following propert…
On the size of -cross-free families
Andrey Kupavskii, János Pach, István Tomon
Two subsets of an -element ground set are said to be \emph{crossing}, if none of the four sets , , and are…