11/4-colorability of subcubic triangle-free graphs
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2022
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866909556106330112 |
|---|---|
| author | Dvořák, Zdeněk Lidický, Bernard Postle, Luke |
| author_facet | Dvořák, Zdeněk Lidický, Bernard Postle, Luke |
| contents | We prove that up to two exceptions, every connected subcubic triangle-free graph has fractional chromatic number at most 11/4. This is tight unless further exceptional graphs are excluded, and improves the known bound on the fractional chromatic number of subcubic triangle-free planar graphs. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2204_12683 |
| institution | arXiv |
| publishDate | 2022 |
| record_format | arxiv |
| spellingShingle | 11/4-colorability of subcubic triangle-free graphs Dvořák, Zdeněk Lidický, Bernard Postle, Luke Combinatorics We prove that up to two exceptions, every connected subcubic triangle-free graph has fractional chromatic number at most 11/4. This is tight unless further exceptional graphs are excluded, and improves the known bound on the fractional chromatic number of subcubic triangle-free planar graphs. |
| title | 11/4-colorability of subcubic triangle-free graphs |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2204.12683 |