A rainbow Erdős-Rothschild problem

DOI10.1016/J.ENDM.2015.06.066zbMATH Open1346.05072OpenAlexW2177566053MaRDI QIDQ322299FDOQ322299

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

Recommendations

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

zbMATH Keywords

extremal graph theoryrainbow coloringsrestricted edge-colorings

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• 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
• Edge-colorings avoiding fixed rainbow stars
• Rainbow Turán Problems
• Title not available (Why is that?)
• THE NUMBER OF EDGE COLORINGS WITH NO MONOCHROMATIC CLIQUES
• Title not available (Why is that?)

Cited In (8)

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

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

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