Stability for the Erdős-Rothschild problem

DOI10.1017/FMS.2023.12MaRDI QIDQ5887143zbMATH OpenOpenAlexFDO

Authors Oleg Pikhurko, Katherine Staden

Publication date 17 April 2023

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

Copyright license Creative Commons Attribution 4.0 International

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)

Recommendations

• The Erdős–Rothschild problem on edge-colourings with forbidden monochromatic cliques
• A rainbow Erdös-Rothschild problem
• A rainbow Erdős-Rothschild problem
• An extension of the rainbow Erdős-Rothschild problem
• Graphs with many edge-colorings such that complete graphs are rainbow

Cites work

• scientific article; zbMATH DE number 3487496 (Why is no real title available?)
• scientific article; zbMATH DE number 3641497 (Why is no real title available?)
• scientific article; zbMATH DE number 554066 (Why is no real title available?)
• scientific article; zbMATH DE number 1540669 (Why is no real title available?)
• scientific article; zbMATH DE number 878896 (Why is no real title available?)
• scientific article; zbMATH DE number 881297 (Why is no real title available?)
• scientific article; zbMATH DE number 3262986 (Why is no real title available?)
• scientific article; zbMATH DE number 3298603 (Why is no real title available?)
• scientific article; zbMATH DE number 3041944 (Why is no real title available?)
• scientific article; zbMATH DE number 3050594 (Why is no real title available?)
• A coloring problem for intersecting vector spaces
• A remark on the number of edge colorings of graphs
• A structural result for hypergraphs with many restricted edge colorings
• An extension of the rainbow Erdős-Rothschild problem
• Edge colourings of graphs avoiding monochromatic matchings of a given size
• Edge-colorings avoiding a fixed matching with a prescribed color pattern
• Edge-colorings avoiding fixed rainbow stars
• Edge-colorings of graphs avoiding fixed monochromatic subgraphs with linear Turán number
• Improved bound on the maximum number of clique-free colorings with two and three colors
• Kneser colorings of uniform hypergraphs
• Maximum number of sum-free colorings in finite abelian groups
• On colourings of hypergraphs without monochromatic Fano planes
• On the maximum number of integer colourings with forbidden monochromatic sums
• Spanning 3-colourable subgraphs of small bandwidth in dense graphs
• THE NUMBER OF EDGE COLORINGS WITH NO MONOCHROMATIC CLIQUES
• The Erdős–Rothschild problem on edge-colourings with forbidden monochromatic cliques
• The maximum number of \(K_{3}\)-free and \(K_{4}\)-free edge 4-colorings
• The number of oriantations having no fixed tournament

Cited in

(5)

• The number of edge colorings with small independence number and no monochromatic H
• Exact solutions to the Erdős-Rothschild problem
• Stability for the Erd\H{o}s-Rothschild problem
• E-stability in the stochastic Ramsey model
• Stability from graph symmetrisation arguments with applications to inducibility

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5887143)