Document Open Access Logo

Strongly Sublinear Separators and Bounded Asymptotic Dimension for Sphere Intersection Graphs

Authors James Davies, Agelos Georgakopoulos, Meike Hatzel , Rose McCarty

PDF

File

Thumbnail PDF
PDF
LIPIcs.SoCG.2025.36.pdf
  • Filesize: 0.78 MB
  • 16 pages

Document Identifiers

Related Versions

Subject Classification

ACM Subject Classification
  • Mathematics of computing → Discrete mathematics
Keywords
  • Intersection graphs
  • strongly sublinear separators
  • asymptotic dimension

Metrics

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

Abstract

In this paper, we consider the class 𝒞^d of sphere intersection graphs in R^d for d ≥ 2. We show that for each integer t, the class of all graphs in 𝒞^d that exclude K_{t,t} as a subgraph has strongly sublinear separators. We also prove that 𝒞^d has asymptotic dimension at most 2d+2.

Cite As Get BibTex

James Davies, Agelos Georgakopoulos, Meike Hatzel, and Rose McCarty. Strongly Sublinear Separators and Bounded Asymptotic Dimension for Sphere Intersection Graphs. In 41st International Symposium on Computational Geometry (SoCG 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 332, pp. 36:1-36:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025) https://doi.org/10.4230/LIPIcs.SoCG.2025.36

Author Details

James Davies
  • University of Cambridge, UK
Agelos Georgakopoulos
  • University of Warwick, UK
Meike Hatzel
  • Institute for Basic Science (IBS), Daejeon, South Korea
Rose McCarty
  • Georgia Institute of Technology, Atlanta, GA, USA

Funding

  • Georgakopoulos, Agelos: Supported by EPSRC grants EP/V048821/1 and EP/V009044/1.
  • Hatzel, Meike: The research was supported by the Institute for Basic Science (IBS-R029-C1).
  • McCarty, Rose: Supported by the National Science Foundation under Grant No. DMS-2202961.

Acknowledgements

This research was initiated during the Banff workshop "New Perspectives in Colouring and Structure (24w5272)". We thank Alex Scott for the construction in Observation 8. We thank Louis Esperet for several helpful discussions.

References

  1. E. M. Andreev. Convex polyhedra of finite volume in Lobačevskiĭ space. Mat. Sb. (N.S.), 83(125):256-260, 1970. Google Scholar
  2. Itai Benjamini and Oded Schramm. Harmonic functions on planar and almost planar graphs and manifolds, via circle packings. Invent. Math., 126(3):565-587, 1996. URL: https://doi.org/10.1007/s002220050109.
  3. Itai Benjamini and Oded Schramm. Lack of sphere packing of graphs via nonlinear potential theory. J. Topol. Anal., 5(1):1-11, 2013. URL: https://doi.org/10.1142/S1793525313500039.
  4. Marthe Bonamy, Nicolas Bousquet, Louis Esperet, Carla Groenland, Chun-Hung Liu, François Pirot, and Alexander Scott. Asymptotic dimension of minor-closed families and assouad-nagata dimension of surfaces. Journal of the European Mathematical Society, 26(10):3739-3791, 2023. Google Scholar
  5. André Bouchet. Circle graph obstructions. J. Comb. Theory, Ser. B, 60(1):107-144, 1994. URL: https://doi.org/10.1006/jctb.1994.1008.
  6. Costas Busch, Ryan Lafortune, and Srikanta Tirthapura. Sparse covers for planar graphs and graphs that exclude a fixed minor. Algorithmica, 69(3):658-684, 2014. URL: https://doi.org/10.1007/s00453-013-9757-4.
  7. L. Sunil Chandran, Mathew C. Francis, and Naveen Sivadasan. Geometric representation of graphs in low dimension using axis parallel boxes. Algorithmica, 56(2):129-140, 2010. URL: https://doi.org/10.1007/s00453-008-9163-5.
  8. Victor Chepoi, Feodor F Dragan, Ilan Newman, Yuri Rabinovich, and Yann Vaxes. Constant approximation algorithms for embedding graph metrics into trees and outerplanar graphs. Discrete & Computational Geometry, 47:187-214, 2012. URL: https://doi.org/10.1007/S00454-011-9386-0.
  9. Fan R. K. Chung. Separator theorems and their applications. In Paths, flows, and VLSI-layout (Bonn, 1988), volume 9 of Algorithms Combin., pages 17-34. Springer, Berlin, 1990. Google Scholar
  10. James Davies. Riemannian planes and string graphs are quasi-isometric to planar graphs. (In Preparation). Google Scholar
  11. James Davies, Robert Hickingbotham, Freddie Illingworth, and Rose McCarty. Fat minors cannot be thinned (by quasi-isometries). URL: https://arxiv.org/abs/2405.09383.
  12. Mark de Berg, Hans L. Bodlaender, Sándor Kisfaludi-Bak, and Sudeshna Kolay. An ETH-tight exact algorithm for Euclidean TSP. SIAM J. Comput., 52(3):740-760, 2023. URL: https://doi.org/10.1137/22M1469122.
  13. Mark de Berg, Hans L. Bodlaender, Sándor Kisfaludi-Bak, Dániel Marx, and Tom C. van der Zanden. A framework for exponential-time-hypothesis-tight algorithms and lower bounds in geometric intersection graphs. SIAM J. Comput., 49(6):1291-1331, 2020. URL: https://doi.org/10.1137/20M1320870.
  14. Mark de Berg, Sándor Kisfaludi-Bak, Morteza Monemizadeh, and Leonidas Theocharous. Clique-based separators for geometric intersection graphs. Algorithmica, 85(6):1652-1678, 2023. URL: https://doi.org/10.1007/s00453-022-01041-8.
  15. Marc Distel. Proper minor-closed classes of graphs have Assouad-Nagata dimension 2, 2023. URL: https://arxiv.org/abs/2308.10377.
  16. Guillermo Durán, Luciano N. Grippo, and Martín D. Safe. Structural results on circular-arc graphs and circle graphs: a survey and the main open problems. Discrete Appl. Math., 164:427-443, 2014. URL: https://doi.org/10.1016/j.dam.2012.12.021.
  17. Zdeněk Dvořák, Rose McCarty, and Sergey Norin. Sublinear separators in intersection graphs of convex shapes. SIAM J. Discrete Math., 35(2):1149-1164, 2021. URL: https://doi.org/10.1137/20M1311156.
  18. Zdeněk Dvořák and Sergey Norin. Strongly sublinear separators and polynomial expansion. SIAM J. Discrete Math., 30(2):1095-1101, 2016. URL: https://doi.org/10.1137/15M1017569.
  19. Zdeněk Dvořák and Sergey Norin. Asymptotic dimension of intersection graphs. European Journal of Combinatorics, page 103631, 2022. Google Scholar
  20. Zdeněk Dvořák and Sergey Norin. Weak diameter coloring of graphs on surfaces. Eur. J. Comb., 121:13, 2024. Id/No 103845. URL: https://doi.org/10.1016/j.ejc.2023.103845.
  21. Zdeněk Dvořák, Jakub Pekárek, Torsten Ueckerdt, and Yelena Yuditsky. Weak coloring numbers of intersection graphs. In 38th international symposium on computational geometry, SoCG 2022, Berlin, Germany, June 7-10, 2022, page 15. Wadern: Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022. Id/No 39. URL: https://doi.org/10.4230/LIPIcs.SoCG.2022.39.
  22. David Eppstein. Minimum dimension for sphere packing a graph in euclidean space. MathOverflow. URL: https://mathoverflow.net/q/86274 (version: 2012-01-21), Author: URL: https://mathoverflow.net/users/440/david-eppstein.
  23. Louis Esperet. Boxicity and topological invariants. European J. Combin., 51:495-499, 2016. URL: https://doi.org/10.1016/j.ejc.2015.07.020.
  24. Jacob Fox and János Pach. A separator theorem for string graphs and its applications. Comb. Probab. Comput., 19(3):371-390, 2010. URL: https://doi.org/10.1017/S0963548309990459.
  25. Jacob Fox, János Pach, Adam Sheffer, Andrew Suk, and Joshua Zahl. A semi-algebraic version of Zarankiewicz’s problem. J. Eur. Math. Soc. (JEMS), 19(6):1785-1810, 2017. URL: https://doi.org/10.4171/JEMS/705.
  26. Koji Fujiwara and Panos Papasoglu. Asymptotic dimension of planes and planar graphs. Trans. Am. Math. Soc., 374(12):8887-8901, 2021. URL: https://doi.org/10.1090/tran/8487.
  27. Agelos Georgakopoulos and Panos Papasoglu. Graph minors and metric spaces, 2023. URL: https://arxiv.org/abs/2305.07456.
  28. Mikhael Gromov. Geometric group theory. Volume 2: Asymptotic invariants of infinite groups. Proceedings of the symposium held at the Sussex University, Brighton, July 14-19, 1991, volume 182 of Lond. Math. Soc. Lect. Note Ser. Cambridge: Cambridge University Press, 1993. Google Scholar
  29. A. Gyárfás. On the chromatic number of multiple interval graphs and overlap graphs. Discrete Math., 55:161-166, 1985. URL: https://doi.org/10.1016/0012-365X(85)90044-5.
  30. Sariel Har-Peled and Kent Quanrud. Approximation algorithms for polynomial-expansion and low-density graphs. SIAM J. Comput., 46(6):1712-1744, 2017. URL: https://doi.org/10.1137/16M1079336.
  31. Zheng-Xu He and Oded Schramm. Fixed points, Koebe uniformization and circle packings. Ann. Math. (2), 137(2):369-406, 1993. URL: https://doi.org/10.2307/2946541.
  32. Lujun Jia, Guolong Lin, Guevara Noubir, Rajmohan Rajaraman, and Ravi Sundaram. Universal approximations for TSP, Steiner tree, and set cover. In Proceedings of the 37th annual ACM symposium on theory of computing, STOC'05. Baltimore, MD, USA, May 22-24, 2005, pages 386-395. New York, NY: Association for Computing Machinery (ACM), 2005. URL: https://doi.org/10.1145/1060590.1060649.
  33. Martina Jørgensen and Urs Lang. Geodesic spaces of low Nagata dimension. Ann. Fenn. Math., 47(1):83-88, 2022. URL: https://doi.org/10.54330/afm.112472.
  34. Sándor Kisfaludi-Bak, Jana Masaříková, Erik Jan van Leeuwen, Bartosz Walczak, and Karol Węgrzycki. Separator theorem and algorithms for planar hyperbolic graphs. In 40th International Symposium on Computational Geometry, volume 293 of LIPIcs. Leibniz Int. Proc. Inform., pages Art. No. 67, 17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024. URL: https://doi.org/10.4230/lipics.socg.2024.67.
  35. Paul Koebe. Kontaktprobleme der konformen Abbildung. Ber. Verh. Sächs. Akad. Leipzig 88, 1936. Google Scholar
  36. T. Kövári, Vera T. Sós, and Pál Turán. On a problem of K. Zarankiewicz. Colloq. Math., 3:50-57, 1954. URL: https://doi.org/10.4064/cm-3-1-50-57.
  37. James R. Lee. Separators in region intersection graphs. In 8th innovations in theoretical computer science conference, ITCS 2017, Berkeley, CA, USA, January 9-11, 2017, page 8. Wadern: Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. Id/No 1. URL: https://doi.org/10.4230/LIPIcs.ITCS.2017.1.
  38. Richard J. Lipton and Robert Endre Tarjan. A separator theorem for planar graphs. SIAM J. Appl. Math., 36(2):177-189, 1979. URL: https://doi.org/10.1137/0136016.
  39. Richard J. Lipton and Robert Endre Tarjan. Applications of a planar separator theorem. SIAM J. Comput., 9(3):615-627, 1980. URL: https://doi.org/10.1137/0209046.
  40. Chun-Hung Liu. Assouad-nagata dimension of minor-closed metrics, 2023. URL: https://doi.org/10.48550/arXiv.2308.12273.
  41. Chun-Hung Liu and Sergey Norin. personal comunication. Google Scholar
  42. Hiroshi Maehara. Space graphs and sphericity. Discrete Appl. Math., 7(1):55-64, 1984. URL: https://doi.org/10.1016/0166-218X(84)90113-6.
  43. Jiří Matoušek. Near-optimal separators in string graphs. Comb. Probab. Comput., 23(1):135-139, 2014. URL: https://doi.org/10.1017/S0963548313000400.
  44. Gary L. Miller, Shang-Hua Teng, William Thurston, and Stephen A. Vavasis. Separators for sphere-packings and nearest neighbor graphs. J. ACM, 44(1):1-29, 1997. URL: https://doi.org/10.1145/256292.256294.
  45. Walid Naji. Reconnaissance des graphes de cordes. Discrete Math., 54:329-337, 1985. URL: https://doi.org/10.1016/0012-365X(85)90117-7.
  46. Serge Plotkin, Satish Rao, and Warren D. Smith. Shallow excluded minors and improved graph decompositions. In Proceedings of the 5th annual ACM-SIAM symposium on discrete algorithms, SODA '94, Arlington, VA, USA, January 23-25, 1994, pages 462-470. New York, NY: ACM; Philadelphia, PA: SIAM, 1994. URL: http://dl.acm.org/citation.cfm?id=314464.314625.
  47. Fred S. Roberts. On the boxicity and cubicity of a graph. Recent Prog. Comb., Proc. 3rd Waterloo Conf. 1968, 301-310 (1969)., 1969. Google Scholar
  48. Rose McCarty. Local Structure for Vertex-Minors. PhD Thesis, UWSpace, 2021. Google Scholar
  49. Alex Scott and David R. Wood. Better bounds for poset dimension and boxicity. Trans. Amer. Math. Soc., 373(3):2157-2172, 2020. URL: https://doi.org/10.1090/tran/7962.
  50. Warren D. Smith and Nicolas C. Wormald. Geometric separator theorems and applications. In Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280), pages 232-243, 1998. URL: https://doi.org/10.1109/SFCS.1998.743449.
  51. William P. Thurston. Collected works of William P. Thurston with commentary: IV. The geometry and topology of three-manifolds: with a preface by Steven P. Kerckhoff. Edited by Benson Farb, David Gabai and Steven P. Kerckhoff. Providence, RI: American Mathematical Society (AMS), 2022. Google Scholar
  52. W. T. jun. Trotter. Interval graphs, interval orders, and their generalizations. Applications of discrete mathematics, Proc. 3rd SIAM Conf., Clemson/South Carolina 1986, 45-58, 1988. Google Scholar
  53. Guoliang Yu. The Novikov conjecture for groups with finite asymptotic dimension. Ann. Math. (2), 147(2):325-355, 1998. URL: https://doi.org/10.2307/121011.
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
© 2023-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact