67 citations · 180 across the 16 of their papers we have counts for
Showing 2012Show all
3 papers · 1 filter
math.CO2012★ 36 cited
Triangle-free geometric intersection graphs with large chromatic number
Arkadiusz Pawlik, Jakub Kozik, Tomasz Krawczyk +4
Several classical constructions illustrate the fact that the chromatic number of a graph can be arbitrarily large compared to its clique number. However, until very recently, no su…
math.CO2012★ 67 cited
Triangle-free intersection graphs of line segments with large chromatic number
Arkadiusz Pawlik, Jakub Kozik, Tomasz Krawczyk +4
In the 1970s, Erdos asked whether the chromatic number of intersection graphs of line segments in the plane is bounded by a function of their clique number. We show the answer is n…
math.CO2012★ 2 cited
An extremal problem on crossing vectors
Michał Lasoń, Piotr Micek, Noah Streib +2
For positive integers and , two vectors and from are called -crossing if there are two coordinates and such that and $B[j…