EUVIMEDEUVIMED entdecken
Crossref

On the Erdős–Sós conjecture for trees with bounded degree

Guido Besomi, Matías Pavez-Signé, Maya Stein

Combinatorics, Probability and Computing · 2021-09 · 30 (5) · 741-761

DOI: 10.1017/s0963548320000528 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Combinatorics, Probability and Computing, online erschienen am 01.02.2021. Verfasst von Guido Besomi und 2 weiteren Autor:innen. Die Arbeit wurde bisher 11-mal zitiert (Crossref) und nennt 16 Literaturangaben.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

We prove the Erdős–Sós conjecture for trees with bounded maximum degree and large dense host graphs. As a corollary, we obtain an upper bound on the multicolour Ramsey number of large trees whose maximum degree is bounded by a constant.

Zitieren

APA

Besomi, G., Pavez-Signé, M., & Stein, M. (2021). On the Erdős–Sós conjecture for trees with bounded degree. Combinatorics, Probability and Computing, 30(5), 741-761. https://doi.org/10.1017/s0963548320000528

Vancouver

Besomi G, Pavez-Signé M, Stein M. On the Erdős–Sós conjecture for trees with bounded degree. Combinatorics, Probability and Computing. 2021;30(5):741-761. doi:10.1017/s0963548320000528

BibTeX
@article{Besomi2021,
  author = {Besomi, Guido and Pavez-Signé, Matías and Stein, Maya},
  title = {On the Erdős–Sós conjecture for trees with bounded degree},
  journal = {Combinatorics, Probability and Computing},
  year = {2021},
  volume = {30},
  number = {5},
  pages = {741--761},
  doi = {10.1017/s0963548320000528}
}
Kostenlos starten →