{"@context":"https:\/\/schema.org\/","@type":"ScholarlyArticle","@id":"#article12203","name":"On the Chromatic Number of Disjointness Graphs of Curves","abstract":"Let omega(G) and chi(G) denote the clique number and chromatic number of a graph G, respectively. The disjointness graph of a family of curves (continuous arcs in the plane) is the graph whose vertices correspond to the curves and in which two vertices are joined by an edge if and only if the corresponding curves are disjoint. A curve is called x-monotone if every vertical line intersects it in at most one point. An x-monotone curve is grounded if its left endpoint lies on the y-axis.\r\nWe prove that if G is the disjointness graph of a family of grounded x-monotone curves such that omega(G)=k, then chi(G)<= binom{k+1}{2}. If we only require that every curve is x-monotone and intersects the y-axis, then we have chi(G)<= k+1\/2 binom{k+2}{3}. Both of these bounds are best possible. The construction showing the tightness of the last result settles a 25 years old problem: it yields that there exist K_k-free disjointness graphs of x-monotone curves such that any proper coloring of them uses at least Omega(k^{4}) colors. This matches the upper bound up to a constant factor.","keywords":["string graph","chromatic number","intersection graph"],"author":[{"@type":"Person","name":"Pach, J\u00e1nos","givenName":"J\u00e1nos","familyName":"Pach","email":"mailto:janos.pach@epfl.ch","affiliation":"\u00c9cole Polytechnique F\u00e9d\u00e9rale de Lausanne, Lausanne, Switzerland","funding":"Research partially supported by Swiss National Science Foundation grants no. 200020-162884 and 200021-175977."},{"@type":"Person","name":"Tomon, Istv\u00e1n","givenName":"Istv\u00e1n","familyName":"Tomon","email":"mailto:istvan.tomon@epfl.ch","affiliation":"\u00c9cole Polytechnique F\u00e9d\u00e9rale de Lausanne, Lausanne, Switzerland","funding":"Research partially supported by Swiss National Science Foundation grants no. 200020-162884 and 200021-175977."}],"position":54,"pageStart":"54:1","pageEnd":"54:17","dateCreated":"2019-06-11","datePublished":"2019-06-11","isAccessibleForFree":true,"license":"https:\/\/creativecommons.org\/licenses\/by\/3.0\/legalcode","copyrightHolder":[{"@type":"Person","name":"Pach, J\u00e1nos","givenName":"J\u00e1nos","familyName":"Pach","email":"mailto:janos.pach@epfl.ch","affiliation":"\u00c9cole Polytechnique F\u00e9d\u00e9rale de Lausanne, Lausanne, Switzerland","funding":"Research partially supported by Swiss National Science Foundation grants no. 200020-162884 and 200021-175977."},{"@type":"Person","name":"Tomon, Istv\u00e1n","givenName":"Istv\u00e1n","familyName":"Tomon","email":"mailto:istvan.tomon@epfl.ch","affiliation":"\u00c9cole Polytechnique F\u00e9d\u00e9rale de Lausanne, Lausanne, Switzerland","funding":"Research partially supported by Swiss National Science Foundation grants no. 200020-162884 and 200021-175977."}],"copyrightYear":"2019","accessMode":"textual","accessModeSufficient":"textual","creativeWorkStatus":"Published","inLanguage":"en-US","sameAs":"https:\/\/doi.org\/10.4230\/LIPIcs.SoCG.2019.54","publisher":"Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik","citation":["http:\/\/arxiv.org\/abs\/1810.00588","http:\/\/arxiv.org\/abs\/1802.09969","http:\/\/arxiv.org\/abs\/1704.01892"],"isPartOf":{"@type":"PublicationVolume","@id":"#volume6332","volumeNumber":129,"name":"35th International Symposium on Computational Geometry (SoCG 2019)","dateCreated":"2019-06-11","datePublished":"2019-06-11","editor":[{"@type":"Person","name":"Barequet, Gill","givenName":"Gill","familyName":"Barequet","email":"mailto:barequet@cs.technion.ac.il","affiliation":"Technion - Israel Inst. of Technology, Haifa, Israel"},{"@type":"Person","name":"Wang, Yusu","givenName":"Yusu","familyName":"Wang","email":"mailto:yusu@cse.ohio-state.edu","affiliation":"The Ohio State University, Ohio, USA"}],"isAccessibleForFree":true,"publisher":"Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik","hasPart":"#article12203","isPartOf":{"@type":"Periodical","@id":"#series116","name":"Leibniz International Proceedings in Informatics","issn":"1868-8969","isAccessibleForFree":true,"publisher":"Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik","hasPart":"#volume6332"}}}