Coloring triple systems with local conditions

From MaRDI portal
Publication:2800545




Abstract: We produce an edge-coloring of the complete 3-uniform hypergraph on n vertices with eO(sqrtloglogn) 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 (logn)o(1) colors.









This page was built for publication: Coloring triple systems with local conditions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2800545)