Document Open Access Logo

Immersions and Albertson’s Conjecture

Authors Jacob Fox, János Pach, Andrew Suk

PDF HTML 5

Files

Thumbnail PDF
PDF
LIPIcs.SoCG.2025.50.pdf
  • Filesize: 0.63 MB
  • 10 pages
HTML5 Logo HTML (experimental)
LIPIcs.SoCG.2025.50.html

Document Identifiers

Subject Classification

ACM Subject Classification
  • Mathematics of computing → Combinatorics
Keywords
  • Immersions
  • crossing numbers
  • chromatic number

Metrics

Abstract

A graph is said to contain K_k (a clique of size k) as a weak immersion if it has k vertices, pairwise connected by edge-disjoint paths. In 1989, Lescure and Meyniel made the following conjecture related to Hadwiger’s conjecture: Every graph of chromatic number k contains K_k as a weak immersion. We prove this conjecture for graphs with at most 1.4(k-1) vertices. As an application, we make some progress on Albertson’s conjecture on crossing numbers of graphs, according to which every graph G with chromatic number k satisfies cr(G) ≥ cr(K_k). In particular, we show that the conjecture is true for all graphs of chromatic number k, provided that they have at most 1.4(k-1) vertices and k is sufficiently large.

Cite As Get BibTex

Jacob Fox, János Pach, and Andrew Suk. Immersions and Albertson’s Conjecture. In 41st International Symposium on Computational Geometry (SoCG 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 332, pp. 50:1-50:10, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025) https://doi.org/10.4230/LIPIcs.SoCG.2025.50

Author Details

Jacob Fox
  • Department of Mathematics, Stanford University, CA, USA
János Pach
  • HUN-REN Alfréd Rényi Institute of Mathematics, Budapest, Hungary
Andrew Suk
  • Department of Mathematics, University of California San Diego, La Jolla, CA, USA

Funding

  • Fox, Jacob: supported by NSF Award DMS-2154129.
  • Pach, János: Rényi Institute, Budapest. Supported by NKFIH grant K-176529 and ERC Advanced Grant "GeoScape."
  • Suk, Andrew: Supported by NSF awards DMS-1952786 and DMS-2246847.

References

  1. E. Ackerman. On topological graphs with at most four crossings per edge. Comput. Geom., 85:101574, 2019. URL: https://doi.org/10.1016/J.COMGEO.2019.101574.
  2. M. Ajtai, V. Chvátal, M. Newborn, and E. Szemerédi. On topological graphs with at most four crossings per edge. Annals of Discrete Mathematics, 12:9-12, 1982. Google Scholar
  3. M. O. Albertson, D. W. Cranston, and J. Fox. Crossings, colorings, and cliques. Electron. J. Combin., 16:11 pp., 2009. Google Scholar
  4. J. Balogh, B. Lidický, S. Norin, F. Pfender, G. Salazar, and S. Spiro. Crossing numbers of complete bipartite graphs. Procedia Comput. Sci., 223:78-87, 2023. URL: https://doi.org/10.1016/J.PROCS.2023.08.216.
  5. J. Balogh, B. Lidický, and G. Salazar. Closing in on Hill’s conjecture. SIAM J. Discrete Math., 33:1261-1276, 2019. URL: https://doi.org/10.1137/17M1158859.
  6. J. Barát and G. Tóth. Towards the Albertson conjecture. Electron. J. Combin., 17:1, 2010. Google Scholar
  7. A. Büngener and M. Kaufmann. Improving the crossing lemma by characterizing dense 2-planar and 3-planar graphs. arxiv:2409.01733, 17:1, 2024. Google Scholar
  8. P. Catlin. Hajós' graph-coloring conjecture: variations and counterexamples. J. Combin. Theory Ser. B, 26:268-274, 1979. URL: https://doi.org/10.1016/0095-8956(79)90062-5.
  9. M. Delcourt and L. Postle. Reducing linear Hadwiger’s conjecture to coloring small graphs. arXiv:2108.01633, 2021. Google Scholar
  10. M. DeVos, Z. Dvořák, J. Fox, J. McDonald, B. Mohar, and D. Scheide. Minimum degree condition forcing complete graph immersion. Combinatorica, 34:279-298, 2014. URL: https://doi.org/10.1007/S00493-014-2806-Z.
  11. M. DeVos, K. Kawarabayashi, B. Mohar, and H. Okamura. Immersing small complete graphs. Ars Math. Contemp., 3:139-146, 2010. URL: https://doi.org/10.26493/1855-3974.112.B74.
  12. Z. Dvořák and L. Yepremyan. Complete graph immersions and minimum degree. J. Graph Theory, 88:211-221, 2018. URL: https://doi.org/10.1002/JGT.22206.
  13. P. Erdős and S. Fajtlowicz. On the conjecture of Hajós. Combinatorica, 1:141-143, 1981. URL: https://doi.org/10.1007/BF02579269.
  14. J. Fox, C. Lee, and B. Sudakov. Chromatic number, clique subdivisions, and the conjectures of Hajós and Erdős-Fajtlowicz. Combinatorica, 33:181-197, 2013. URL: https://doi.org/10.1007/S00493-013-2853-X.
  15. T. Gallai. Kritische Graphen II. Publ. Math. Inst. Hungar. Acad. Sci., 8:373-395, 1963. Google Scholar
  16. G. Gauthier, T.-N. Le, and P. Wollan. Forcing clique immersions through chromatic number. European J. Combin., 81:98-118, 2019. URL: https://doi.org/10.1016/J.EJC.2019.04.003.
  17. A. V. Kostochka. Lower bound of the Hadwiger number of graphs by their average degree. Combinatorica, 4:307-316, 1984. URL: https://doi.org/10.1007/BF02579141.
  18. T. Leighton. Complexity Issues in VLSI. Foundations of Computing Series, MIT Press, Cambridge, MA, 1983. Google Scholar
  19. F. Lescure and H. Meyniel. On a problem upon configurations contained in graphs with given chromatic number. Ann. Discrete Math., 41:325-331, 1989. Google Scholar
  20. S. Norin, L. Postle, and Z. Song. Breaking the degeneracy barrier for coloring graphs with no K_t minor. Adv. Math., 422:109020, 2023. Google Scholar
  21. J. Pach and G. Tóth. Thirteen problems on crossing numbers. Geombinatorics, 9:194-207, 2000. Google Scholar
  22. N. Robertson, P. Seymour, and R. Thomas. Hadwiger’s conjecture for K₆-free graphs. Combinatorica, 13:279-361, 1993. Google Scholar
  23. C. E. Shannon. A theorem on coloring the lines of a network. J. Math. Phys., 28:148-152, 1949. Google Scholar
  24. A. Thomason. An extremal function for contractions of graphs. Math. Proc. Cambridge Philos. Soc., 95:261-265, 1984. Google Scholar
  25. V. G. Vizing. The chromatic class of a multigraph. Kibernetika, 3:29-39, 1965. Google Scholar
Any Issues?
X

Feedback on the Current Page

CAPTCHA

Thanks for your feedback!

Feedback submitted to Dagstuhl Publishing

Could not send message

Please try again later or send an E-mail
© 2023-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact