67 citations · 256 across the 18 of their papers we have counts for
4 papers · 1 filter
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…
The coloring game on matroids
Michał Lasoń
A coloring of the ground set of a matroid is proper if elements of the same color form an independent set. For a loopless matroid , its chromatic number is the minimum nu…
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…
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…