EUVIMEDEUVIMED entdecken
Crossref

Maximum and Minimum Degree Conditions for Embedding Trees

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

SIAM Journal on Discrete Mathematics · 2020-01 · 34 (4) · 2108-2123

DOI: 10.1137/19m1277667 ↗

Kurz gefasst

Fachartikel in der Zeitschrift SIAM Journal on Discrete Mathematics, online erschienen am 13.10.2020. Verfasst von Guido Besomi und 2 weiteren Autor:innen. Die Arbeit wurde bisher 5-mal zitiert (Crossref) und nennt 24 Literaturangaben. Gefördert von: Fondo Nacional de Desarrollo Científico y Tecnológico, Comisión Nacional de Investigación Científica y Tecnológica.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

We propose the following conjecture: For every fixed $\alpha\in [0,\frac 13)$, each graph of minimum degree at least $(1+\alpha)\frac k2$ and maximum degree at least $2(1-\alpha)k$ contains each tree with $k$ edges as a subgraph. Our main result is an approximate version of the conjecture for bounded degree trees and large dense host graphs. We also show that our conjecture is asymptotically best possible. The proof of the approximate result relies on a second result, which we believe to be interesting on its own. Namely, we can embed any bounded degree tree into host graphs of minimum/maximum degree asymptotically exceeding $\frac k2$ and $\frac 43k$, respectively, as long as the host graph avoids a specific structure.

Förderung

  • Fondo Nacional de Desarrollo Científico y Tecnológico
  • Comisión Nacional de Investigación Científica y Tecnológica

Zitieren

APA

Besomi, G., Pavez-Signé, M., & Stein, M. (2020). Maximum and Minimum Degree Conditions for Embedding Trees. SIAM Journal on Discrete Mathematics, 34(4), 2108-2123. https://doi.org/10.1137/19m1277667

Vancouver

Besomi G, Pavez-Signé M, Stein M. Maximum and Minimum Degree Conditions for Embedding Trees. SIAM Journal on Discrete Mathematics. 2020;34(4):2108-2123. doi:10.1137/19m1277667

BibTeX
@article{Besomi2020,
  author = {Besomi, Guido and Pavez-Signé, Matías and Stein, Maya},
  title = {Maximum and Minimum Degree Conditions for Embedding Trees},
  journal = {SIAM Journal on Discrete Mathematics},
  year = {2020},
  volume = {34},
  number = {4},
  pages = {2108--2123},
  doi = {10.1137/19m1277667}
}
Kostenlos starten →