Induced subgraphs of graphs with large chromatic number. XII. Distant stars
Journal of Graph Theory · 2019-11 · 92 (3) · 237-254
DOI: 10.1002/jgt.22450 ↗Kurz gefasst
Fachartikel in der Zeitschrift Journal of Graph Theory, online erschienen am 11.02.2019. Verfasst von Maria Chudnovsky und 2 weiteren Autor:innen. Die Arbeit wurde bisher 20-mal zitiert (Crossref) und nennt 9 Literaturangaben. Gefördert von: National Sleep Foundation, Army Research Office.
Abstract (Originalsprache)
The Gyárfás‐Sumner conjecture asserts that if is a tree then every graph with bounded clique number and very large chromatic number contains as an induced subgraph. This is still open, although it has been proved for a few simple families of trees, including trees of radius two, some special trees of radius three, and subdivided stars. These trees all have the property that their vertices of degree more than two are clustered quite closely together. In this paper, we prove the conjecture for two families of trees which do not have this restriction. As special cases, these families contain all double‐ended brooms and two‐legged caterpillars.
Förderung
- National Sleep Foundation
- Army Research Office
Zitieren
APA
Chudnovsky, M., Scott, A., & Seymour, P. (2019). Induced subgraphs of graphs with large chromatic number. XII. Distant stars. Journal of Graph Theory, 92(3), 237-254. https://doi.org/10.1002/jgt.22450
Vancouver
Chudnovsky M, Scott A, Seymour P. Induced subgraphs of graphs with large chromatic number. XII. Distant stars. Journal of Graph Theory. 2019;92(3):237-254. doi:10.1002/jgt.22450
BibTeX
@article{Chudnovsky2019,
author = {Chudnovsky, Maria and Scott, Alex and Seymour, Paul},
title = {Induced subgraphs of graphs with large chromatic number. XII. Distant stars},
journal = {Journal of Graph Theory},
year = {2019},
volume = {92},
number = {3},
pages = {237--254},
doi = {10.1002/jgt.22450}
}
EUVIMED