Document Open Access Logo

The Density Formula: One Lemma to Bound Them All

Authors Michael Kaufmann , Boris Klemz , Kristin Knorr , Meghana M. Reddy , Felix Schröder , Torsten Ueckerdt

PDF
Thumbnail PDF

File

LIPIcs.GD.2024.7.pdf
  • Filesize: 0.97 MB
  • 17 pages

Document Identifiers

Author Details

Michael Kaufmann
  • University of Tübingen, Germany
Boris Klemz
  • Universität Würzburg, Germany
Kristin Knorr
  • Freie Universität Berlin, Germany
Meghana M. Reddy
  • ETH Zürich, Switzerland
Felix Schröder
  • Technische Universität Berlin, Germany
  • Charles University, Prague, Czech Republic
Torsten Ueckerdt
  • Karlsruhe Institute of Technology, Germany

Funding

  • Schröder, Felix: supported by the Czech Science Foundation grant GAČR 23-04949X.
  • Ueckerdt, Torsten: supported by the Deutsche Forschungsgemeinschaft - 520723789.

Cite AsGet BibTex

Michael Kaufmann, Boris Klemz, Kristin Knorr, Meghana M. Reddy, Felix Schröder, and Torsten Ueckerdt. The Density Formula: One Lemma to Bound Them All. In 32nd International Symposium on Graph Drawing and Network Visualization (GD 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 320, pp. 7:1-7:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
https://doi.org/10.4230/LIPIcs.GD.2024.7

Abstract

We introduce the Density Formula for (topological) drawings of graphs in the plane or on the sphere, which relates the number of edges, vertices, crossings, and sizes of cells in the drawing. We demonstrate its capability by providing several applications: we prove tight upper bounds on the edge density of various beyond-planar graph classes, including so-called k-planar graphs with k = 1,2, fan-crossing/fan-planar graphs, k-bend RAC-graphs with k = 0,1,2, quasiplanar graphs, and k^+-real face graphs. In some cases (1-bend and 2-bend RAC-graphs and fan-crossing/fan-planar graphs), we thereby obtain the first tight upper bounds on the edge density of the respective graph classes. In other cases, we give new streamlined and significantly shorter proofs for bounds that were already known in the literature. Thanks to the Density Formula, all of our proofs are mostly elementary counting and mostly circumvent the typical intricate case analysis found in earlier proofs. Further, in some cases (simple and non-homotopic quasiplanar graphs), our alternative proofs using the Density Formula lead to the first tight lower bound examples.

Subject Classification

ACM Subject Classification
  • Mathematics of computing → Graph theory
  • Mathematics of computing → Graphs and surfaces
Keywords
  • beyond-planar
  • density
  • fan-planar
  • fan-crossing
  • right-angle crossing
  • quasiplanar

Metrics

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

Related Versions

References

  1. Eyal Ackerman. On the maximum number of edges in topological graphs with no four pairwise crossing edges. Discrete & Computational Geometry, 41(3):365-375, 2009. URL: https://doi.org/10.1007/s00454-009-9143-9.
  2. Eyal Ackerman. On topological graphs with at most four crossings per edge. Computational Geometry, 85:101574, 2019. URL: https://doi.org/10.1016/j.comgeo.2019.101574.
  3. Eyal Ackerman and Balázs Keszegh. The maximum size of adjacency-crossing graphs. arXiv preprint, 2023. URL: https://doi.org/10.48550/arXiv.2309.06507.
  4. Eyal Ackerman and Gábor Tardos. On the maximum number of edges in quasi-planar graphs. Journal of Combinatorial Theory, Series A, 114(3):563-571, 2007. URL: https://doi.org/10.1016/j.jcta.2006.08.002.
  5. Patrizio Angelini, Michael A. Bekos, Henry Förster, and Michael Kaufmann. On RAC drawings of graphs with one bend per edge. Theoretical Computer Science, 828-829:42-54, 2020. URL: https://doi.org/10.1016/j.tcs.2020.04.018.
  6. Patrizio Angelini, Michael A. Bekos, Julia Katheder, Michael Kaufmann, Maximilian Pfister, and Torsten Ueckerdt. Axis-parallel right angle crossing graphs. In Inge Li Gørtz, Martin Farach-Colton, Simon J. Puglisi, and Grzegorz Herman, editors, 31st Annual European Symposium on Algorithms (ESA 2023), volume 274 of Leibniz International Proceedings in Informatics (LIPIcs), pages 9:1-9:15, Dagstuhl, Germany, 2023. Schloss Dagstuhl - Leibniz-Zentrum für Informatik. URL: https://doi.org/10.4230/LIPIcs.ESA.2023.9.
  7. Patrizio Angelini, Michael A. Bekos, Michael Kaufmann, Maximilian Pfister, and Torsten Ueckerdt. Beyond-planarity: Turán-type results for non-planar bipartite graphs. In 29th International Symposium on Algorithms and Computation (ISAAC 2018), volume 123, pages 28:1-28:13, 2018. URL: https://doi.org/10.4230/LIPIcs.ISAAC.2018.28.
  8. Karin Arikushi, Radoslav Fulek, Balázs Keszegh, Filip Moric, and Csaba D. Tóth. Graphs that admit right angle crossing drawings. Comput. Geom., 45(4):169-177, 2012. URL: https://doi.org/10.1016/J.COMGEO.2011.11.008.
  9. Michael A. Bekos, Prosenjit Bose, Aaron Büngener, Vida Dujmović, Michael Hoffmann, Michael Kaufmann, Pat Morin, Saeed Odak, and Alexandra Weinberger. On k-planar graphs without short cycles. arXiv preprint, 2024. URL: https://arxiv.org/abs/2408.16085.
  10. Carla Binucci, Giuseppe Di Battista, Walter Didimo, Seok-Hee Hong, Michael Kaufmann, Giuseppe Liotta, Pat Morin, and Alessandra Tappini. Nonplanar graph drawings with k vertices per face. In Daniël Paulusma and Bernard Ries, editors, Graph-Theoretic Concepts in Computer Science - 49th International Workshop, WG 2023, Fribourg, Switzerland, June 28-30, 2023, Revised Selected Papers, volume 14093 of Lecture Notes in Computer Science, pages 86-100. Springer, 2023. URL: https://doi.org/10.1007/978-3-031-43380-1_7.
  11. 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.
  12. Otfried Cheong, Henry Förster, Julia Katheder, Maximilian Pfister, and Lena Schlipf. Weakly and strongly fan-planar graphs. In Graph Drawing and Network Visualization, pages 53-68. Springer Nature Switzerland, 2023. URL: https://doi.org/10.1007/978-3-031-49272-3_4.
  13. Walter Didimo, Peter Eades, and Giuseppe Liotta. Drawing graphs with right angle crossings. Theoretical Computer Science, 412(39):5156-5166, 2011. URL: https://doi.org/10.1016/j.tcs.2011.05.025.
  14. Walter Didimo, Giuseppe Liotta, and Fabrizio Montecchiani. A survey on graph drawing beyond planarity. ACM Computing Surveys, 52(1), 2019. URL: https://doi.org/10.1145/3301281.
  15. Michael Kaufmann, Boris Klemz, Kristin Knorr, Meghana M. Reddy, Felix Schröder, and Torsten Ueckerdt. The density formula: One lemma to bound them all. arXiv preprint, 2024. URL: https://doi.org/10.48550/arXiv.2311.06193.
  16. Michael Kaufmann and Torsten Ueckerdt. The density of fan-planar graphs. arXiv preprint, 2014. URL: https://arxiv.org/abs/1403.6184.
  17. Michael Kaufmann and Torsten Ueckerdt. The density of fan-planar graphs. Electronic Journal of Combinatorics, 29(1):P1.29, 2022. URL: https://doi.org/10.37236/10521.
  18. Boris Klemz, Kristin Knorr, Meghana M. Reddy, and Felix Schröder. Simplifying non-simple fan-planar drawings. J. Graph Algorithms Appl., 27(2):147-172, 2023. Conference version in Proc. GD 2021 (https://doi.org/10.1007/978-3-030-92931-2_4). URL: https://doi.org/10.7155/JGAA.00618.
  19. János Pach. Notes on geometric graph theory, volume 6 of DIMACS Series, pages 273-285. American Mathematical Society, Providence, RI, 1991. URL: https://doi.org/10.1090/DIMACS/006/19.
  20. János Pach and Géza Tóth. Graphs drawn with few crossings per edge. Combinatorica, 17(3):427-439, 1997. URL: https://doi.org/10.1007/BF01215922.
  21. Csaba D. Tóth. On RAC drawings of graphs with two bends per edge. In Graph Drawing and Network Visualization, pages 69-77. Springer Nature Switzerland, 2023. URL: https://doi.org/10.1007/978-3-031-49272-3_5.
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-2024 Schloss Dagstuhl – LZI GmbH Imprint Privacy Contact