By Xiaolan Hu and Xing Peng

For a simple graph $G$, let $\chi_f(G)$ be the fractional chromatic number of $G$. In this paper, we aim to establish upper bounds on $\chi_f(G)$ for those graphs $G$ with restrictions on the clique number. Namely, we prove that for $\Delta \geq 4$, if $G$ has maximum degree at most... Show more

August 3, 2021

Loading full text...

Similar articles

Loading recommendations...

x1

The fractional chromatic number of $K_Δ$-free graphs

Click on play to start listening