10 citations · 38 across the 54 of their papers we have counts for
Showing 2018Show all
3 papers · 1 filter
math.CO2018
On the chromatic number of disjointness graphs of curves
Janos Pach, Istvan Tomon
Let and denote the clique number and chromatic number of a graph , respectively. The {\em disjointness graph} of a family of curves (continuous arcs in the plane)…
math.CO2018★ 3 cited
Improved Ramsey-type results for comparability graphs
Dániel Korándi, István Tomon
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 impor…
math.CO2018★ 1 cited
Packing the Boolean lattice with copies of a poset
Istvan Tomon
Let be a partially ordered set. We prove that if is sufficiently large, then there exists a packing of copies of in the Boolean lattice $(2^{[n]},\subset)…