An optimal chromatic bound for ($P_2+P_3$, gem)-free graphs

Arnab Char, T. Karthick

Given a graph $G$, the parameters $\chi (G)$ and $\omega (G)$ respectively denote the chromatic number and the clique number of $G$. A function $f:\mathbb{N}\to \mathbb{N}$ such t…