Twin-width of sparse random graphs
| Autor: | Hendrey, Kevin, Norin, Sergey, Steiner, Raphael, Turcotte, Jérémie |
|---|---|
| Rok vydání: | 2023 |
| Předmět: | |
| Druh dokumentu: | Working Paper |
| Popis: | We show that the twin-width of every $n$-vertex $d$-regular graph is at most $n^{\frac{d-2}{2d-2}+o(1)}$ and that almost all $d$-regular graphs attain this bound. More generally, we obtain bounds on the twin-width of sparse Erd\H{o}s-Renyi and regular random graphs, complementing the bounds in the denser regime due to Ahn, Chakraborti, Hendrey, Kim and Oum. Comment: 22 pages |
| Databáze: | arXiv |
| Externí odkaz: |
|