Coloring Triple Systems with Local Conditions

DOI10.1002/jgt.21876zbMath1379.05040arXiv1410.3010OpenAlexW1600793037MaRDI QIDQ2800545

Dhruv Mubayi

Publication date: 15 April 2016

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

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

zbMATH Keywords

complete 3-uniform hypergraph

Mathematics Subject Classification ID

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

Related Items (2)

A (5,5)-Colouring of K_n with Few Colours ⋮ Off-diagonal hypergraph Ramsey numbers

Cites Work

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

This page was built for publication: Coloring Triple Systems with Local Conditions