A (5,5)-Colouring of Kn with Few Colours

DOI10.1017/S0963548318000172zbMath1402.05145arXiv1702.06227OpenAlexW2799411888MaRDI QIDQ4554774

Alex Cameron, Emily A. Heath

Publication date: 9 November 2018

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55) Ramsey theory (05D10)

Related Items (3)

New upper bounds for the Erdős-Gyárfás problem on generalized Ramsey numbers ⋮ Lower bounds on the Erdős–Gyárfás problem via color energy graphs ⋮ An explicit edge-coloring of \(K_n\) with six colors on every \(K_5\)

Cites Work

• Unnamed Item
• Unnamed Item
• An explicit construction for a Ramsey problem
• A dense infinite Sidon sequence
• A variant of the classical Ramsey problem
• Edge-coloring cliques with three colors on all 4-cliques
• A generalized Ramsey problem
• Coloring Triple Systems with Local Conditions
• The Erdős-Gyárfás problem on generalized Ramsey numbers
• Almost -rainbow edge-colorings of some small graphs
• Edge-coloring cliques with many colors on subcliques

This page was built for publication: A (5,5)-Colouring of K_n with Few Colours