Spanning trees in graphs of high minimum degree with a universal vertex I: An asymptotic result
Journal of Graph Theory · 2023-04 · 102 (4) · 737-783
DOI: 10.1002/jgt.22897 ↗Kurz gefasst
Fachartikel in der Zeitschrift Journal of Graph Theory, online erschienen am 07.10.2022. Verfasst von Bruce Reed und 1 weiteren Autor:innen. Die Arbeit wurde bisher 7-mal zitiert (Crossref) und nennt 21 Literaturangaben. Gefördert von: Natural Sciences and Engineering Research Council of Canada, Fondo Nacional de Desarrollo Científico, Tecnológico y de Innovación Tecnológica, Comisión Nacional de Investigación Científica y Tecnológica.
Abstract (Originalsprache)
In this paper and a companion paper, 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 recent conjecture by Havet, Reed, Stein and Wood. The present paper already contains an approximate version of the result.
Förderung
- Natural Sciences and Engineering Research Council of Canada
- Fondo Nacional de Desarrollo Científico, Tecnológico y de Innovación Tecnológica
- Comisión Nacional de Investigación Científica y Tecnológica
Zitieren
APA
Reed, B., & Stein, M. (2023). Spanning trees in graphs of high minimum degree with a universal vertex I: An asymptotic result. Journal of Graph Theory, 102(4), 737-783. https://doi.org/10.1002/jgt.22897
Vancouver
Reed B, Stein M. Spanning trees in graphs of high minimum degree with a universal vertex I: An asymptotic result. Journal of Graph Theory. 2023;102(4):737-783. doi:10.1002/jgt.22897
BibTeX
@article{Reed2023,
author = {Reed, Bruce and Stein, Maya},
title = {Spanning trees in graphs of high minimum degree with a universal vertex I: An asymptotic result},
journal = {Journal of Graph Theory},
year = {2023},
volume = {102},
number = {4},
pages = {737--783},
doi = {10.1002/jgt.22897}
}
EUVIMED