En-Kai Zhang

Density regions, integer certificates and packing colorings of distance graphs

We study simultaneous color densities in packing colorings of integer distance graphs. For $D(1,6)$, we determine several exact density regions and prove that colors $1$ through $7$ have maximum combined density $211/252$. When this maximum is approached, the seven individual color frequencies are forced to converge to...