The Erdős–Rothschild problem on edge-colourings with forbidden monochromatic cliques

DOI10.1017/S0305004116001031zbMath1371.05095arXiv1605.05074MaRDI QIDQ5360466

Oleg Pikhurko, Katherine Staden, Zelealem B. Yilma

Publication date: 28 September 2017

Published in: Mathematical Proceedings of the Cambridge Philosophical Society (Search for Journal in Brave)

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

zbMATH Keywords

stability theorem for complete multipartite graphs

Mathematics Subject Classification ID

05C15: Coloring of graphs and hypergraphs

05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)