稀疏临界图的Brooks型结果
A Brooks-type result for sparse critical graphs
摘要:
一个图$G$是$k$ -{ \em critical},如果它有色数$k$,但$G$的每个真子图都是$(k-1)$ --可着色的.用$f_k(n)$表示$n$ -顶点$k$ -临界图的最小边数.最近,作者给出了一个下界,$f_k(n) \geq \left\lceil \frac{(k+1)(k-2)|V(G)|-k(k-3)}{2(k-1)}\right\rceil$,解决了Gallai从1963年提出的一个猜想,并且对每个$n\equiv 1\,({\rm mod }\, k-1)$都是尖锐的。对于$k=4$和每一个$n\geq 6$来说,它也是尖锐的。本文通过用$|E(G)|= \frac{(k+1)(k-2)|V(G)|-k(k-3)}{2(k-1)}$描述所有的$n$ -顶点$k$ -临界图$G$来改进这个结果.特别地,该结果意味着当$f_5(n)$.
英文摘要:
A graph $G$ is $k$-{\em critical} if it has chromatic number $k$, but every proper subgraph of $G$ is $(k-1)$--colorable. Let $f_k(n)$ denote the minimum number of edges in an $n$-vertex $k$-critical graph. Recently the authors gave a lower bound, $f_k(n) \geq \left\lceil \frac{(k+1)(k-2)|V(G)|-k(k-3)}{2(k-1)}\right\rceil$, that solves a conjecture by Gallai from 1963 and is sharp for every $n\equiv 1\,({\rm mod }\, k-1)$. It is also sharp for $k=4$ and every $n\geq 6$. In this paper we refine the result by describing all $n$-vertex $k$-critical graphs $G$ with $|E(G)|= \frac{(k+1)(k-2)|V(G)|-k(k-3)}{2(k-1)}$. In particular, this result implies exact values of $f_5(n)$ when $n\geq 7$.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。