A rainbow Erdős-Rothschild problem

DOI10.1016/J.ENDM.2015.06.066zbMath1346.05072OpenAlexW2177566053MaRDI QIDQ322299

Hanno Lefmann, Knut Odermann, Carlos Hoppen

Publication date: 14 October 2016

Full work available at URL: https://doi.org/10.1016/j.endm.2015.06.066

zbMATH Keywords

extremal graph theoryrainbow coloringsrestricted edge-colorings

Mathematics Subject Classification ID

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

Related Items (6)

Edge-colorings of graphs avoiding complete graphs with a prescribed coloring ⋮ On graphs with a large number of edge-colorings avoiding a rainbow triangle ⋮ Stability of extremal hypergraphs with applications to an edge-coloring problem ⋮ A Rainbow Erdös--Rothschild Problem ⋮ The Typical Structure of Gallai Colorings and Their Extremal Graphs ⋮ Counting Gallai 3-colorings of complete graphs

Cites Work

• Edge-colorings avoiding fixed rainbow stars
• Edge-colorings avoiding a fixed matching with a prescribed color pattern
• Multicolour Turán problems
• A remark on the number of edge colorings of graphs
• Edge-colorings of graphs avoiding fixed monochromatic subgraphs with linear Turán number
• Rainbow Turán Problems
• THE NUMBER OF EDGE COLORINGS WITH NO MONOCHROMATIC CLIQUES
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A rainbow Erdős-Rothschild problem