Stability for the Erdős-Rothschild problem

DOI10.1017/FMS.2023.12OpenAlexW3190077370MaRDI QIDQ5887143

Oleg Pikhurko, Katherine Staden

Publication date: 17 April 2023

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

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

zbMATH Keywords

stability theorem for complete multipartite graphs\(\mathfrak{k}\)-extremal graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15)

Related Items (1)

Exact solutions to the Erdős-Rothschild problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Edge-colorings avoiding fixed rainbow stars
• A structural result for hypergraphs with many restricted edge colorings
• A coloring problem for intersecting vector spaces
• Spanning 3-colourable subgraphs of small bandwidth in dense graphs
• Edge-colorings avoiding a fixed matching with a prescribed color pattern
• Maximum number of sum-free colorings in finite abelian groups
• An extension of the rainbow Erdős-Rothschild problem
• A remark on the number of edge colorings of graphs
• The number of oriantations having no fixed tournament
• Edge-colorings of graphs avoiding fixed monochromatic subgraphs with linear Turán number
• On the maximum number of integer colourings with forbidden monochromatic sums
• Kneser Colorings of Uniform Hypergraphs
• Edge Colourings of Graphs Avoiding Monochromatic Matchings of a Given Size
• The maximum number of K ₃ -free and K ₄ -free edge 4-colorings
• On Colourings of Hypergraphs Without Monochromatic Fano Planes
• Improved Bound on the Maximum Number of Clique-Free Colorings with Two and Three Colors
• THE NUMBER OF EDGE COLORINGS WITH NO MONOCHROMATIC CLIQUES
• The Erdős–Rothschild problem on edge-colourings with forbidden monochromatic cliques

This page was built for publication: Stability for the Erdős-Rothschild problem