Coloring graphs with dense neighborhoods

It is shown that any graph with maximum degree $Δ$ in which the average degree of the induced subgraph on the set of all neighbors of any vertex exceeds $\frac{6k^2}{6k^2 + 1}Δ+ k + 6$ is either $(Δ- k)$-colorable or contains a clique on more than $Δ- 2k$ vertices. In the $k=1$ case we improve the bound on the average degree to $\frac23Δ+ 4$ and the bound on the clique number to $Δ-1$. As corollaries, we show that every graph satisfies $χ\leq \max\set{ω, Δ- 1, 4α}$ and every graph satisfies $χ\leq \max\set{ω, Δ- 1, \ceil{\frac{15 + \sqrt{48n + 73}}{4}}}$.

No reviews yet.

No comments yet.