A Rainbow Erdös--Rothschild Problem

DOI10.1137/16M1098139zbMath1376.05073OpenAlexW2775561983MaRDI QIDQ4596826

Carlos Hoppen, Knut Odermann, Hanno Lefmann

Publication date: 11 December 2017

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

Full work available at URL: https://doi.org/10.1137/16m1098139

zbMATH Keywords

extremal graph theoryedge coloringsTurán problem

Mathematics Subject Classification ID

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

Related Items

Remarks on an edge-coloring problem, Integer colorings with no rainbow \(k\)-term arithmetic progression, Counting orientations of graphs with no strongly connected tournaments, Uniform hypergraphs with many edge‐colorings avoiding a fixed rainbow expanded complete graph, Integer colorings with forbidden rainbow sums, Edge-colorings avoiding patterns in a triangle, Graphs with many edge-colorings such that complete graphs are rainbow, Extremal problems and results related to Gallai-colorings, An extension of the rainbow Erdős-Rothschild problem, The Typical Structure of Gallai Colorings and Their Extremal Graphs, Rainbow Erdös--Rothschild Problem for the Fano Plane, The number of Gallai \(k\)-colorings of complete graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A rainbow Erdős-Rothschild problem
• Edge-colorings avoiding fixed rainbow stars
• A proof of the stability of extremal graphs, Simonovits' stability from Szemerédi's regularity
• Hypergraph containers
• A structural result for hypergraphs with many restricted edge colorings
• Limits of dense graph sequences
• Edge-colorings avoiding a fixed matching with a prescribed color pattern
• Multicoloured extremal problems
• Multicolour Turán problems
• Rainbow Turán problem for even cycles
• 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
• Rainbow Turán Problems
• On Colourings of Hypergraphs Without Monochromatic Fano Planes
• THE NUMBER OF EDGE COLORINGS WITH NO MONOCHROMATIC CLIQUES
• Exact Results on the Number of Restricted Edge Colorings for Some Families of Linear Hypergraphs
• Independent sets in hypergraphs
• The Erdős–Rothschild problem on edge-colourings with forbidden monochromatic cliques
• The History of Degenerate (Bipartite) Extremal Graph Problems
• A Combinatorial Theorem