Tight bounds towards a conjecture of Gallai
Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:2ZC2LAU5record.jsonopen to challenge →
classification
math.CO
keywords
chromaticconjecturegallainumbertightabbottanswersbound
read the original abstract
We prove that for $n>k\geq 3$, 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 paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.