Creative Commons Attribution 4.0 license (CC BY 4.0)when quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.SoCG.2022.56
URN: urn:nbn:de:0030-drops-160645
URL: https://drops.dagstuhl.de/opus/volltexte/2022/16064/
Pach, János ; Tardos, Gábor ; Tóth, Géza
Disjointness Graphs of Short Polygonal Chains
| pdf-format: |
|
Abstract
The disjointness graph of a set system is a graph whose vertices are the sets, two being connected by an edge if and only if they are disjoint. It is known that the disjointness graph G of any system of segments in the plane is χ-bounded, that is, its chromatic number χ(G) is upper bounded by a function of its clique number ω(G).Here we show that this statement does not remain true for systems of polygonal chains of length 2. We also construct systems of polygonal chains of length 3 such that their disjointness graphs have arbitrarily large girth and chromatic number. In the opposite direction, we show that the class of disjointness graphs of (possibly self-intersecting) 2-way infinite polygonal chains of length 3 is χ-bounded: for every such graph G, we have χ(G) ≤ (ω(G))³+ω(G).
BibTeX - Entry
@InProceedings{pach_et_al:LIPIcs.SoCG.2022.56,
author = {Pach, J\'{a}nos and Tardos, G\'{a}bor and T\'{o}th, G\'{e}za},
title = {{Disjointness Graphs of Short Polygonal Chains}},
booktitle = {38th International Symposium on Computational Geometry (SoCG 2022)},
pages = {56:1--56:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-227-3},
ISSN = {1868-8969},
year = {2022},
volume = {224},
editor = {Goaoc, Xavier and Kerber, Michael},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2022/16064},
URN = {urn:nbn:de:0030-drops-160645},
doi = {10.4230/LIPIcs.SoCG.2022.56},
annote = {Keywords: chi-bounded, disjointness graph}
}
| Keywords: | chi-bounded, disjointness graph | |
| Seminar: | 38th International Symposium on Computational Geometry (SoCG 2022) | |
| Issue date: | 2022 | |
| Date of publication: | 01.06.2022 |
