Premium
Coloring Triple Systems with Local Conditions
Author(s) -
Mubayi Dhruv
Publication year - 2016
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/jgt.21876
Subject(s) - hypergraph , combinatorics , mathematics , list coloring , enhanced data rates for gsm evolution , fractional coloring , set (abstract data type) , complete coloring , edge coloring , discrete mathematics , graph , computer science , artificial intelligence , graph power , line graph , programming language
We produce an edge‐coloring of the complete 3‐uniform hypergraph on n vertices with e O ( log log n )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 (Int Math Res Not, to appear) who asked whether such a coloring exists with( log n ) o ( 1 )colors.