Polynomial Gyárfás-Sumner conjecture for graphs of bounded boxicity
Fuente:
arXiv
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866907990661005312 |
|---|---|
| author | Davies, James Yuditsky, Yelena |
| author_facet | Davies, James Yuditsky, Yelena |
| contents | 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) $χ$-bounded. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2407_16882 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Polynomial Gyárfás-Sumner conjecture for graphs of bounded boxicity Davies, James Yuditsky, Yelena Combinatorics Computational Geometry 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) $χ$-bounded. |
| title | Polynomial Gyárfás-Sumner conjecture for graphs of bounded boxicity |
| topic | Combinatorics Computational Geometry |
| url | https://arxiv.org/abs/2407.16882 |