Title
Polychromatic Colorings on the Integers.
Abstract
We show that for any set $Ssubseteq mathbb{Z}$, $|S|=4$ there exists a 3-coloring of $mathbb{Z}$ in which every translate of $S$ receives all three colors. This implies that $S$ has a codensity of at most $1/3$, proving a conjecture of Newman [D. J. Newman, Complements of finite sets of integers, Michigan Math. J. 14 (1967) 481--486]. We also consider related questions in $mathbb{Z}^d$, $dgeq 2$.
Year
Venue
Field
2019
Integers
Integer,Combinatorics,Mathematics
DocType
Volume
ISSN
Journal
19
Integers: Electronic Journal of Combinatorial Number Theory 19 (2019) A18
Citations 
PageRank 
References 
0
0.34
3
Authors
7
Name
Order
Citations
PageRank
Maria Axenovich120933.90
John L. Goldwasser25914.86
Bernard Lidický395.00
Ryan R. Martin43610.12
David Offner5163.95
John M. Talbot6789.61
Michael Young7164.39