Coloring triple systems with local conditions
Combinatorics
2014-10-14 v1
Abstract
We produce an edge-coloring of the complete 3-uniform hypergraph on n vertices with colors such that the edges spanned by every set of five vertices receive at least three distinct colors. This answers the first open case of a question of Conlon-Fox-Lee-Sudakov [1] who asked whether such a coloring exists with colors.
Cite
@article{arxiv.1410.3010,
title = {Coloring triple systems with local conditions},
author = {Dhruv Mubayi},
journal= {arXiv preprint arXiv:1410.3010},
year = {2014}
}