Tree independence number III. Thetas, prisms and stars

Autor:	Chudnovsky, Maria, Hajebi, Sepehr, Trotignon, Nicolas
Rok vydání:	2024
Předmět:	Mathematics - Combinatorics
Druh dokumentu:	Working Paper
Popis:	We prove that for every $t\in \mathbb{N}$ there exists $\tau=\tau(t)\in \mathbb{N}$ such that every (theta, prism, $K_{1,t}$)-free graph has tree independence number at most $\tau$ (where we allow "prisms" to have one path of length zero).
Databáze:	arXiv
Externí odkaz:	http://arxiv.org/abs/2406.13053 Zobrazit plný text záznamu View this record from Arxiv