An explicit edge-coloring of \(K_n\) with six colors on every \(K_5\)

zbMath1422.05067arXiv1704.01156MaRDI QIDQ2327227

Alex Cameron

Publication date: 14 October 2019

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

extremal graph theoryprobabilistic methods

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55) Ramsey theory (05D10)

Cites Work

• Unnamed Item
• An explicit construction for a Ramsey problem
• A variant of the classical Ramsey problem
• Edge-coloring cliques with three colors on all 4-cliques
• A generalized Ramsey problem
• The Erdős-Gyárfás problem on generalized Ramsey numbers
• A (5,5)-Colouring of K_n with Few Colours
• Almost -rainbow edge-colorings of some small graphs
• Edge-coloring cliques with many colors on subcliques

This page was built for publication: An explicit edge-coloring of \(K_n\) with six colors on every \(K_5\)