Person
Istvan Tomon
This person is no longer with EPFL
Related publications (8)
Improved Ramsey-type results for comparability graphs
Istvan Tomon, Dániel József Korándi
Several discrete geometry problems are equivalent to estimating the size of the largest homogeneous sets in graphs that happen to be the union of few comparability graphs. An important observation for such results is that if G is an n-vertex graph that is ...
CAMBRIDGE UNIV PRESS2020Packing the Boolean lattice with copies of a poset
The Boolean lattice (2[n],subset of) is the family of all subsets of [n]={1,MIDLINE HORIZONTAL ELLIPSIS,n}, ordered by inclusion. Let P be a partially ordered set. We prove that if n is sufficiently large, then there exists a packing P of copies of P in (2 ...
WILEY2020Forbidden induced subposets of given height
Let P be a partially ordered set. The function La* (n, P) denotes the size of the largest family F subset of 2([n]) that does not contain an induced copy of P. It was proved by Methuku and Palvolgyi that there exists a constant C-P (depending only on P) su ...
ACADEMIC PRESS INC ELSEVIER SCIENCE2019On the Turan number of ordered forests
Gábor Tardos, Istvan Tomon, Dániel József Korándi
An ordered graph H is a simple graph with a linear order on its vertex set. The corresponding Turan problem, first studied by Pach and Tardos, asks for the maximum number ex(
ACADEMIC PRESS INC ELSEVIER SCIENCE2019Ordered graphs and large bi-cliques in intersection graphs of curves
An ordered graph G(
ACADEMIC PRESS LTD- ELSEVIER SCIENCE LTD2019On the Size of K-Cross-Free Families
János Pach, Andrei Kupavskii, Istvan Tomon
Two subsets A,B of an n-element ground set X are said to be crossing, if none of the four sets AB, A\B, B\A and X(AB) are empty. It was conjectured by Karzanov and Lomonosov forty years ago that if a family F of subsets of X does not contain k pairwise cr ...
SPRINGER HEIDELBERG2019Ordered Graphs And Large Bi-Cliques In Intersection Graphs Of Curves
An ordered graph G(
COMENIUS UNIV2019Almost tiling of the Boolean lattice with copies of a poset
Let P be a partially ordered set. If the Boolean lattice (2[n],⊂) can be partitioned into copies of P for some positive integer n, then P must satisfy the following two trivial conditions: (1) the size of P is a power of 2, (2) P has a unique maximal and m ...
ELECTRONIC JOURNAL OF COMBINATORICS2018