Polynomial Gy\'arf\'as-Sumner conjecture for graphs of bounded boxicity
<|reference_start|>Polynomial Gy\'arf\'as-Sumner conjecture for graphs of bounded boxicity: We prove that for every positive integer $d$ and forest $F$, the class of intersection graphs of axis-aligned boxes in $\mathbb{R}^d$ with no induced $F$ subgraph is (polynomially) $\chi$-bounded.<|reference_end|>
@article{davies2024polynomial,
    title={Polynomial Gy\'arf\'as-Sumner conjecture for graphs of bounded boxicity},
    author={James Davies and Yelena Yuditsky},
    journal={arXiv preprint arXiv:2407.16882},
    year={2024},
    archivePrefix={arXiv},
    eprint={2407.16882},
    primaryClass={math.CO cs.CG}
}