paper

Injective colorings of graphs with low average degree

arXiv:1006.3776

Abstract

Let $\mad(G)$ denote the maximum average degree (over all subgraphs) of and let denote the injective chromatic number of . We prove that if and $\mad(G)<\frac{14}5$, then . When , we show that $\mad(G)<\frac{36}{13}$ implies . In contrast, we give a graph with , $\mad(G)=\frac{36}{13}$, and .

15 pages, 3 figures