1 paper · 1 filter
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…