Tree Independence Number III. Thetas, Prisms and Stars
ABSTRACT We prove that for every there exists such that every (theta, prism, )‐free graph has tree independence number at most (where we allow “prisms” to have one path of length zero).
Authors
- Maria Chudnovsky (ORCID: https://orcid.org/0000-0002-8920-4944)
- Sepehr Hajebi (ORCID: https://orcid.org/0000-0002-4551-7834)
- Nicolas Trotignon (ORCID: https://orcid.org/0000-0003-1978-0687)
Institutions
- Université Claude Bernard Lyon 1 (FR)
- École Normale Supérieure de Lyon (FR)
- Centre National de la Recherche Scientifique (FR)
- University of Waterloo (CA)
- Princeton University (US)
Publication Details
- Journal
- Journal of Graph Theory
- Published
- 2026-06-17
- DOI
- https://doi.org/10.1002/jgt.70088
- Citations
- 1
- Primary Topic
- Mathematics and Applications
- Type
- preprint
- Field-Weighted Citation Impact
- 0.00
Funders
- National Science Foundation
- Agence Nationale de la Recherche
- Université de Lyon
- Horizon 2020 Framework Programme
- Air Force Office of Scientific Research