EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

Size‐Ramsey Numbers of Structurally Sparse Graphs

Nemanja Draganić, Marc Kaufmann, David Munhá Correia, Kalina Petrova, Raphael Steiner

Random Structures & Algorithms · 2026-03 · 68 (2)

DOI: 10.1002/rsa.70059 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Random Structures & Algorithms, online erschienen am 19.03.2026. Verfasst von Nemanja Draganić und 4 weiteren Autor:innen. Die Arbeit nennt 31 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: Eidgenössische Technische Hochschule Zürich, Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Size‐Ramsey numbers are a central notion in combinatorics and have been widely studied since their introduction by Erdős, Faudree, Rousseau, and Schelp in 1978. Research has mainly focused on the size‐Ramsey numbers of ‐vertex graphs with constant maximum degree . For example, graphs which also have constant treewidth are known to have linear size‐Ramsey numbers. On the other extreme, the canonical examples of graphs of unbounded treewidth are the grid graphs, for which the best known bound has only very recently been improved from to by Conlon, Nenadov and Trujić. In this paper, we study a common generalization of these problems and establish new bounds on the size‐Ramsey numbers in terms of treewidth (which may grow as a function of ). As a special case, this yields a bound of for proper minor‐closed classes of graphs. In particular, this bound applies to planar graphs, addressing a question of Kamcev, Liebenau, Wood and Yepremyan. Our proof combines methods from structural graph theory and classic Ramsey‐theoretic embedding techniques, taking advantage of the product structure exhibited by graphs with bounded treewidth.

Förderung

  • Eidgenössische Technische Hochschule Zürich
  • Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung

Zitieren

APA

Draganić, N., Kaufmann, M., Correia, D. M., Petrova, K., & Steiner, R. (2026). Size‐Ramsey Numbers of Structurally Sparse Graphs. Random Structures & Algorithms, 68(2). https://doi.org/10.1002/rsa.70059

Vancouver

Draganić N, Kaufmann M, Correia DM, Petrova K, Steiner R. Size‐Ramsey Numbers of Structurally Sparse Graphs. Random Structures & Algorithms. 2026;68(2). doi:10.1002/rsa.70059

BibTeX
@article{Dragani2026,
  author = {Draganić, Nemanja and Kaufmann, Marc and Correia, David Munhá and Petrova, Kalina and Steiner, Raphael},
  title = {Size‐Ramsey Numbers of Structurally Sparse Graphs},
  journal = {Random Structures & Algorithms},
  year = {2026},
  volume = {68},
  number = {2},
  doi = {10.1002/rsa.70059}
}
Kostenlos starten →