Coloring kk-free intersection graphs of geometric objects in the plane

Abstract

The <i>intersection graph</i> of a collection <i>C</i> of sets is a graph on the vertex set <i>C</i>, in which <i>C</i><sub>1</sub>,<i>C</i><sub>2</sub> &#8712; <i>C</i> are joined by an edge if and only if <i>C</i><sub>1</sub> &#8745; <i>C</i><sub>2</sub> &#8800; &#216;. Erd&#246;s conjectured that the chromatic number of triangle-free intersection graphs… (More)
DOI: 10.1145/1377676.1377735

Topics

1 Figure or Table

Cite this paper

@inproceedings{Fox2008ColoringKI, title={Coloring kk-free intersection graphs of geometric objects in the plane}, author={Jacob Fox and J{\'a}nos Pach}, booktitle={Symposium on Computational Geometry}, year={2008} }