11/4-colorability of subcubic triangle-free graphs
Date
2022-05-01
Authors
Major Professor
Advisor
Committee Member
Journal Title
Journal ISSN
Volume Title
Publisher
© 2022 The Authors
Abstract
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.
Series Number
Journal Issue
Is Version Of
Versions
Series
Academic or Administrative Unit
Type
Preprint
Comments
This preprint is made available through arXiv at doi:https://doi.org/10.48550/arXiv.2204.12683.
This work is licensed under the Creative Commons Attribution 4.0 License.