Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2406.13053 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866914190317322240 |
|---|---|
| author | Chudnovsky, Maria Hajebi, Sepehr Trotignon, Nicolas |
| author_facet | Chudnovsky, Maria Hajebi, Sepehr Trotignon, Nicolas |
| contents | We prove that for every $t\in \mathbb{N}$, there exists $τ=τ(t)\in \mathbb{N}$ such that every (theta, prism, $K_{1,t}$)-free graph has tree independence number at most $τ$ (where we allow "prisms" to have one path of length zero). |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2406_13053 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Tree independence number III. Thetas, prisms and stars Chudnovsky, Maria Hajebi, Sepehr Trotignon, Nicolas Combinatorics We prove that for every $t\in \mathbb{N}$, there exists $τ=τ(t)\in \mathbb{N}$ such that every (theta, prism, $K_{1,t}$)-free graph has tree independence number at most $τ$ (where we allow "prisms" to have one path of length zero). |
| title | Tree independence number III. Thetas, prisms and stars |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2406.13053 |