adv

An asymptotic bound for the strong chromatic number. (arXiv:1711.08214v2 [math.CO] UPDATED)

来源于:arXiv
The strong chromatic number $\chi_{\text{s}}(G)$ of a graph $G$ on $n$ vertices is the least number $r$ with the following property: after adding $r \lceil n/r \rceil - n$ isolated vertices to $G$ and taking the union with any collection of spanning disjoint copies of $K_r$ in the same vertex set, the resulting graph has a proper vertex-colouring with $r$ colours. We show that for every $c > 0$ and every graph $G$ on $n$ vertices with $\Delta(G) \ge cn$, $\chi_{\text{s}}(G) \leq (2 + o(1)) \Delta(G)$, which is asymptotically best possible. 查看全文>>