Triangle-free intersection graphs of line segments with large chromatic number

On some properties of linear complexes

Alexander A. Zykov · 1949

Earlier work this paper cites.

Sur le coloriage des graphes

Jan Mycielski · 1955

Earlier work this paper cites.

On a colouring problem

Edgar Asplund and Branko Grünbaum · 1960

Earlier work this paper cites.

On coloring problems of families of prototypes

James P. Burling · 1965

Earlier work this paper cites.

Covering and coloring problems for relatives of intervals

András Gyárfás and Jenő Lehel · 1985

Earlier work this paper cites.

Problems from the world surrounding perfect graphs

András Gyárfás · 1987

Earlier work this paper cites.

Some geometric applications of Dilworth‘s theorem

János Pach and Jenő Törőcsik · 1994

Cited alongside, same era.

Chromatic number of geometric intersection graphs

Alexandr Kostochka and Jaroslav Nešetřil · 1995

Cited alongside, same era.

Induced trees in graphs of large chromatic number

Alex D. Scott · 1997

Cited alongside, same era.

Coloring relatives of intervals on the plane I: chromatic number versus girth

Alexandr Kostochka and Jaroslav Nešetřil · 1998

Cited alongside, same era.

Colouring arcwise connected sets in the plane I

Sean McGuinness · 2000

Cited alongside, same era.

personal communication

Jacob Fox and János Pach

Cited in the paper.

Colouring arcwise connected sets in the plane II

Sean McGuinness · 2001

Later among the works it cites.

Research Problems in Discrete Geometry

Peter Brass, William Moser, and János Pach · 2005

Later among the works it cites.

Triangle-free geometric intersection graphs with large chromatic number

Arkadiusz Pawlik, Jakub Kozik, Tomasz Krawczyk, Michał Lasoń, Piotr Micek, William T. Trotter, and Bartosz Walczak · 2013

Closest in time.

Coloring intersection graphs of x x -monotone curves in the plane

Andrew Suk · 2014

Closest in time.

Triangle-free geometric intersection graphs with no large independent sets

Bartosz Walczak · 2015

Closest in time.