Tight bounds towards a conjecture of Gallai

MaRDI QIDQ6400451zbMATH OpenFDO

Authors Jun Gao, Jie Ma

Publication date 28 May 2022

Abstract: We prove that for $n>kgeq3$, if $G$ is an $n$-vertex graph with chromatic number $k$ but any its proper subgraph has smaller chromatic number, then $G$ contains at most $n-k+3$ copies of cliques of size $k-1$. This answers a problem of Abbott and Zhou and provides a tight bound on a conjecture of Gallai.

This page was built for publication: Tight bounds towards a conjecture of Gallai

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6400451)