Coloring triple systems with local conditions

DOI10.1002/JGT.21876zbMATH Open1379.05040arXiv1410.3010OpenAlexW1600793037MaRDI QIDQ2800545FDOQ2800545

Dhruv Mubayi

Publication date: 15 April 2016

Published in: Journal of Graph Theory (Search for Journal in Brave)

Abstract: We produce an edge-coloring of the complete 3-uniform hypergraph on n vertices with $e^{O(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.

Full work available at URL: https://arxiv.org/abs/1410.3010

zbMATH Keywords

complete 3-uniform hypergraph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Hypergraphs (05C65)

Cites Work

• Primitive Recursive Bounds for Van Der Waerden Numbers
• The Erdős-Gyárfás problem on generalized Ramsey numbers
• A variant of the classical Ramsey problem
• Edge-coloring cliques with three colors on all 4-cliques
• An explicit construction for a Ramsey problem
• On the Grid Ramsey Problem and Related Questions: Fig. 1.
• Edge-coloring cliques with many colors on subcliques
• When is an Almost MonochromaticK₄Guaranteed?
• Ramsey-Type Problem for an Almost Monochromatic $K_4$

Cited In (5)

• A (5,5)-Colouring of K_n with Few Colours
• On the edge-coloring property for Hanani triple systems
• Off-diagonal hypergraph Ramsey numbers
• On locally rainbow colourings
• Growth rates of the bipartite Erdős-Gyárfás function

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)