Spanning trees in graphs of high minimum degree with a universal vertex II: A tight result
Journal of Graph Theory · 2023-04 · 102 (4) · 797-821
DOI: 10.1002/jgt.22899 ↗Kurz gefasst
Fachartikel in der Zeitschrift Journal of Graph Theory, online erschienen am 03.10.2022. Verfasst von Bruce Reed und 1 weiteren Autor:innen. Die Arbeit wurde bisher 7-mal zitiert (Crossref) und nennt 15 Literaturangaben. Gefördert von: Comisión Nacional de Investigación Científica y Tecnológica, Natural Sciences and Engineering Research Council of Canada.
Abstract (Originalsprache)
We prove that, if is sufficiently large, every graph on vertices that has a universal vertex and minimum degree at least contains each tree with edges as a subgraph. Our result confirms, for large , an important special case of a conjecture by Havet, Reed, Stein, and Wood. The present paper builds on the results of a companion paper in which we proved the statement for all trees having a vertex that is adjacent to many leaves.
Förderung
- Comisión Nacional de Investigación Científica y Tecnológica
- Natural Sciences and Engineering Research Council of Canada
Zitieren
APA
Reed, B., & Stein, M. (2023). Spanning trees in graphs of high minimum degree with a universal vertex II: A tight result. Journal of Graph Theory, 102(4), 797-821. https://doi.org/10.1002/jgt.22899
Vancouver
Reed B, Stein M. Spanning trees in graphs of high minimum degree with a universal vertex II: A tight result. Journal of Graph Theory. 2023;102(4):797-821. doi:10.1002/jgt.22899
BibTeX
@article{Reed2023,
author = {Reed, Bruce and Stein, Maya},
title = {Spanning trees in graphs of high minimum degree with a universal vertex II: A tight result},
journal = {Journal of Graph Theory},
year = {2023},
volume = {102},
number = {4},
pages = {797--821},
doi = {10.1002/jgt.22899}
}
EUVIMED