David G. Harris, Aravind Srinivasan. A note on near-optimal coloring of shift hypergraphs. Random Struct. Algorithms, 48(1):53-56, 2016. [doi]
@article{HarrisS16,
title = {A note on near-optimal coloring of shift hypergraphs},
author = {David G. Harris and Aravind Srinivasan},
year = {2016},
doi = {10.1002/rsa.20565},
url = {http://dx.doi.org/10.1002/rsa.20565},
researchr = {https://researchr.org/publication/HarrisS16},
cites = {0},
citedby = {0},
journal = {Random Struct. Algorithms},
volume = {48},
number = {1},
pages = {53-56},
}