2 citations · 3 across the 2 of their papers we have counts for
3 papers
math.CO2017★ 1 cited
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{…
math.CO2017
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…
math.CO2017★ 2 cited
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…