Suns in Triangle-Free Graphs of Large Chromatic Number
The Electronic Journal of Combinatorics · 27.03.2026 · 33 (1)
DOI: 10.37236/14443 ↗Kurz gefasst
Fachartikel in der Zeitschrift The Electronic Journal of Combinatorics, online erschienen am 27.03.2026. Verfasst von Sepehr Hajebi und 1 weiteren Autor:innen.
Abstract (Originalsprache)
For an integer $t\geq 4$, a $t$-sun is a graph obtained from a $t$-vertex cycle $C$ by adding a degree-one neighbor for each vertex of $C$. Trotignon asked whether every triangle-free graph of sufficiently large chromatic number has an induced subgraph that is a $t$-sun for some $t\geq 4$. This remains open, but we show that every triangle-free graph of chromatic number at least $48$ has an induced subgraph that is either a $t$-sun for some $t\geq 5$, or a $4$-sun with a single degree-one vertex deleted. In fact, we prove that for all $\ell\geq 5$, there exists $c=c(\ell)\in \mathbb{N}$ such that every triangle-free graph of chromatic number at least $c$ has an induced subgraph that is either a $t$-sun for some $t\geq \ell$, or a $4$-sun with a single degree-one vertex deleted.
Zitieren
APA
Hajebi, S., & Spirkl, S. (2026). Suns in Triangle-Free Graphs of Large Chromatic Number. The Electronic Journal of Combinatorics, 33(1). https://doi.org/10.37236/14443
Vancouver
Hajebi S, Spirkl S. Suns in Triangle-Free Graphs of Large Chromatic Number. The Electronic Journal of Combinatorics. 2026;33(1). doi:10.37236/14443
BibTeX
@article{Hajebi2026,
author = {Hajebi, Sepehr and Spirkl, Sophie},
title = {Suns in Triangle-Free Graphs of Large Chromatic Number},
journal = {The Electronic Journal of Combinatorics},
year = {2026},
volume = {33},
number = {1},
doi = {10.37236/14443}
}
EUVIMED