Edge-colorings avoiding fixed rainbow stars

DOI10.1016/J.ENDM.2015.07.046zbMath1347.05067OpenAlexW2213950720MaRDI QIDQ324811

Hanno Lefmann, Carlos Hoppen, Knut Odermann, Juliana Sanches

Publication date: 17 October 2016

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

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 (5)

Stability for the Erdős-Rothschild problem ⋮ A rainbow Erdős-Rothschild problem ⋮ On the maximum number of integer colourings with forbidden monochromatic sums ⋮ A Rainbow Erdös--Rothschild Problem ⋮ The Erdős–Rothschild problem on edge-colourings with forbidden monochromatic cliques

Cites Work

• Unnamed Item
• Unnamed Item
• The asymptotic number of labeled graphs with given degree sequences
• Uniform generation of \(d\)-factors in dense host graphs
• A remark on the number of edge colorings of graphs
• 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
• THE NUMBER OF EDGE COLORINGS WITH NO MONOCHROMATIC CLIQUES

This page was built for publication: Edge-colorings avoiding fixed rainbow stars