Exact solutions to the Erdős-Rothschild problem

DOI10.1017/fms.2023.117zbMath1530.05096arXiv2108.12789OpenAlexW4390667292MaRDI QIDQ6178441

Oleg Pikhurko, Katherine Staden

Publication date: 18 January 2024

Published in: Forum of Mathematics, Sigma (Search for Journal in Brave)

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

zbMATH Keywords

Hadamard matricescomplete multipartite graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Coloring of graphs and hypergraphs (05C15)

Related Items (1)

Edge-colorings avoiding patterns in a triangle

Cites Work

• A proof of the stability of extremal graphs, Simonovits' stability from Szemerédi's regularity
• The maximum number of K ₃ -free and K ₄ -free edge 4-colorings
• THE NUMBER OF EDGE COLORINGS WITH NO MONOCHROMATIC CLIQUES
• The Erdős–Rothschild problem on edge-colourings with forbidden monochromatic cliques
• Stability for the Erdős-Rothschild problem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Exact solutions to the Erdős-Rothschild problem