Intersection Graphs with and Without Product Structure

Authors Laura Merker , Lena Scherzer, Samuel Schneider , Torsten Ueckerdt



PDF
Thumbnail PDF

File

LIPIcs.GD.2024.23.pdf
  • Filesize: 1.59 MB
  • 19 pages

Document Identifiers

Author Details

Laura Merker
  • Karlsruhe Institute of Technology (KIT), Germany
Lena Scherzer
  • Karlsruhe Institute of Technology (KIT), Germany
Samuel Schneider
  • Karlsruhe Institute of Technology (KIT), Germany
Torsten Ueckerdt
  • Karlsruhe Institute of Technology (KIT), Germany

Cite AsGet BibTex

Laura Merker, Lena Scherzer, Samuel Schneider, and Torsten Ueckerdt. Intersection Graphs with and Without Product Structure. In 32nd International Symposium on Graph Drawing and Network Visualization (GD 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 320, pp. 23:1-23:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
https://doi.org/10.4230/LIPIcs.GD.2024.23

Abstract

A graph class 𝒢 admits product structure if there exists a constant k such that every G ∈ 𝒢 is a subgraph of H ⊠ P for a path P and some graph H of treewidth k. Famously, the class of planar graphs, as well as many beyond-planar graph classes are known to admit product structure. However, we have only few tools to prove the absence of product structure, and hence know of only a few interesting examples of classes. Motivated by the transition between product structure and no product structure, we investigate subclasses of intersection graphs in the plane (e.g., disk intersection graphs) and present necessary and sufficient conditions for these to admit product structure. Specifically, for a set S ⊂ ℝ² (e.g., a disk) and a real number α ∈ [0,1], we consider intersection graphs of α-free homothetic copies of S. That is, each vertex v is a homothetic copy of S of which at least an α-portion is not covered by other vertices, and there is an edge between u and v if and only if u ∩ v ≠ ∅. For α = 1 we have contact graphs, which are in most cases planar, and hence admit product structure. For α = 0 we have (among others) all complete graphs, and hence no product structure. In general, there is a threshold value α^*(S) ∈ [0,1] such that α-free homothetic copies of S admit product structure for all α > α^*(S) and do not admit product structure for all α < α^*(S). We show for a large family of sets S, including all triangles and all trapezoids, that it holds α^*(S) = 1, i.e., we have no product structure, except for the contact graphs (when α = 1). For other sets S, including regular n-gons for infinitely many values of n, we show that 0 < α^*(S) < 1 by proving upper and lower bounds.

Subject Classification

ACM Subject Classification
  • Mathematics of computing → Graphs and surfaces
  • Mathematics of computing → Graph theory
Keywords
  • Product structure
  • intersection graphs
  • linear local treewidth

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads

References

  1. Michael A. Bekos, Giordano Da Lozzo, Petr Hliněný, and Michael Kaufmann. Graph Product Structure for h-Framed Graphs. In Sang Won Bae and Heejin Park, editors, 33rd International Symposium on Algorithms and Computation (ISAAC 2022), volume 248 of Leibniz International Proceedings in Informatics (LIPIcs), pages 23:1-23:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022. URL: https://doi.org/10.4230/LIPIcs.ISAAC.2022.23.
  2. Marthe Bonamy, Cyril Gavoille, and Michał Pilipczuk. Shorter Labeling Schemes for Planar Graphs. SIAM Journal on Discrete Mathematics, 36(3):2082-2099, September 2022. Publisher: Society for Industrial and Applied Mathematics. URL: https://doi.org/10.1137/20M1330464.
  3. Édouard Bonnet, O-joung Kwon, and David R. Wood. Reduced bandwidth: a qualitative strengthening of twin-width in minor-closed classes (and beyond), 2022. https://arxiv.org/abs/2202.11858, URL: https://doi.org/10.48550/arXiv.2202.11858.
  4. Prosenjit Bose, Vida Dujmović, Mehrnoosh Javarsineh, Pat Morin, and David R. Wood. Separating layered treewidth and row treewidth. Discrete Mathematics & Theoretical Computer Science, vol. 24, no. 1(Graph Theory), May 2022. URL: https://doi.org/10.46298/dmtcs.7458.
  5. Prosenjit Bose, Vida Dujmović, Mehrnoosh Javarsineh, and Pat Morin. Asymptotically optimal vertex ranking of planar graphs, 2020. https://arxiv.org/abs/2007.06455, URL: https://doi.org/10.48550/arXiv.2007.06455.
  6. Franz J. Brandenburg. On fan-crossing graphs. Theoretical Computer Science, 841:39-49, 2020. URL: https://doi.org/10.1016/j.tcs.2020.07.002.
  7. Michał Dębski, Piotr Micek, Felix Schröder, and Stefan Felsner. Improved bounds for centered colorings. Advances in Combinatorics, August 2021. URL: https://doi.org/10.19086/aic.27351.
  8. Marc Distel, Robert Hickingbotham, Michał T. Seweryn, and David R. Wood. Powers of planar graphs, product structure, and blocking partitions. European Conference on Combinatorics, Graph Theory and Applications, pages 355-361, August 2023. URL: https://doi.org/10.5817/CZ.MUNI.EUROCOMB23-049.
  9. Vida Dujmović, Louis Esperet, Cyril Gavoille, Gwenaël Joret, Piotr Micek, and Pat Morin. Adjacency labelling for planar graphs (and beyond). J. ACM, 68(6), October 2021. URL: https://doi.org/10.1145/3477542.
  10. Vida Dujmović, Louis Esperet, Gwenaël Joret, Bartosz Walczak, and David Wood. Planar graphs have bounded nonrepetitive chromatic number. Advances in Combinatorics, March 2020. URL: https://doi.org/10.19086/aic.12100.
  11. Vida Dujmović, Louis Esperet, Pat Morin, and David R. Wood. Proof of the clustered hadwiger conjecture. In 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS), pages 1921-1930, 2023. URL: https://doi.org/10.1109/FOCS57990.2023.00116.
  12. Vida Dujmović, Gwenaël Joret, Piotr Micek, Pat Morin, Torsten Ueckerdt, and David R. Wood. Planar graphs have bounded queue-number. J. ACM, 67(4), August 2020. URL: https://doi.org/10.1145/3385731.
  13. Vida Dujmović, Pat Morin, and Saeed Odak. Odd colourings of graph products, 2022. URL: https://doi.org/10.48550/arXiv.2202.12882.
  14. Vida Dujmović, Louis Esperet, Pat Morin, Bartosz Walczak, and David R. Wood. Clustered 3-colouring graphs of bounded degree. Combinatorics, Probability and Computing, 31(1):123-135, 2022. URL: https://doi.org/10.1017/S0963548321000213.
  15. Vida Dujmović, Pat Morin, and David R. Wood. Layered separators in minor-closed graph classes with applications. Journal of Combinatorial Theory, Series B, 127:111-147, 2017. URL: https://doi.org/10.1016/j.jctb.2017.05.006.
  16. Vida Dujmović, Pat Morin, and David R. Wood. Graph product structure for non-minor-closed classes. Journal of Combinatorial Theory, Series B, 162:34-67, 2023. URL: https://doi.org/10.1016/j.jctb.2023.03.004.
  17. Zdeněk Dvořák, Tony Huynh, Gwenael Joret, Chun-Hung Liu, and David R. Wood. Notes on graph product structure theory. In Jan de Gier, Cheryl E. Praeger, and Terence Tao, editors, 2019-20 MATRIX Annals, pages 513-533, Cham, 2021. Springer International Publishing. URL: https://doi.org/10.1007/978-3-030-62497-2_32.
  18. Zdeněk Dvořák, Daniel Gonçalves, Abhiruk Lahiri, Jane Tan, and Torsten Ueckerdt. On comparable box dimension. In Xavier Goaoc and Michael Kerber, editors, 38th International Symposium on Computational Geometry (SoCG 2022), volume 224 of Leibniz International Proceedings in Informatics (LIPIcs), pages 38:1-38:14, Dagstuhl, Germany, 2022. Schloss Dagstuhl - Leibniz-Zentrum für Informatik. URL: https://doi.org/10.4230/LIPIcs.SoCG.2022.38.
  19. Louis Esperet, Gwenaël Joret, and Pat Morin. Sparse universal graphs for planarity. Journal of the London Mathematical Society, 108(4):1333-1357, 2023. URL: https://doi.org/10.1112/jlms.12781.
  20. Robert Hickingbotham and David R. Wood. Shallow minors, graph products, and beyond-planar graphs. SIAM Journal on Discrete Mathematics, 38(1):1057-1089, 2024. URL: https://doi.org/10.1137/22M1540296.
  21. Gwenaël Joret and Clément Rambaud. Neighborhood complexity of planar graphs, 2023. URL: https://doi.org/10.48550/arXiv.2302.12633.
  22. Daniel Kráľ, Kristýna Pekárková, and Kenny Štorgel. Twin-width of graphs on surfaces, 2024. URL: https://doi.org/10.48550/arXiv.2307.05811.
  23. Laura Merker, Lena Scherzer, Samuel Schneider, and Torsten Ueckerdt. Intersection graphs with and without product structure, 2024. URL: https://doi.org/10.48550/arXiv.2409.01732.
  24. Neil Robertson and Paul D. Seymour. Graph minors. II. Algorithmic aspects of tree-width. Journal of Algorithms, 7(3):309-322, 1986. URL: https://doi.org/10.1016/0196-6774(86)90023-4.
  25. Torsten Ueckerdt, David Wood, and Wendy Yi. An improved planar graph product structure theorem. The Electronic Journal of Combinatorics, pages P2-51, 2022. URL: https://doi.org/10.37236/10614.
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail