An extension of the rainbow Erdős-Rothschild problem

DOI10.1016/J.DISC.2021.112443zbMath1466.05070arXiv2103.11892OpenAlexW3171331848MaRDI QIDQ2032865

Carlos Hoppen, Hanno Lefmann, Denilson Nolibos

Publication date: 14 June 2021

Published in: Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

Turán problem\((k - 1)\)-partite Turán graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (3)

Stability for the Erdős-Rothschild problem ⋮ Edge-colorings avoiding patterns in a triangle ⋮ Graphs with many edge-colorings such that complete graphs are rainbow

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A proof of the stability of extremal graphs, Simonovits' stability from Szemerédi's regularity
• The number of Gallai \(k\)-colorings of complete graphs
• Edge-colorings avoiding a fixed matching with a prescribed color pattern
• Edge colorings of graphs without monochromatic stars
• Remarks on an edge-coloring problem
• Edge-colorings of graphs avoiding complete graphs with a prescribed coloring
• A remark on the number of edge colorings of graphs
• On graphs with a large number of edge-colorings avoiding a rainbow triangle
• The number of oriantations having no fixed tournament
• Edge-colorings of graphs avoiding fixed monochromatic subgraphs with linear Turán number
• The maximum number of K ₃ -free and K ₄ -free edge 4-colorings
• Improved Bound on the Maximum Number of Clique-Free Colorings with Two and Three Colors
• A Rainbow Erdös--Rothschild Problem
• THE NUMBER OF EDGE COLORINGS WITH NO MONOCHROMATIC CLIQUES
• The Typical Structure of Gallai Colorings and Their Extremal Graphs
• The Erdős–Rothschild problem on edge-colourings with forbidden monochromatic cliques
• The History of Degenerate (Bipartite) Extremal Graph Problems

This page was built for publication: An extension of the rainbow Erdős-Rothschild problem