On graphs with a large number of edge-colorings avoiding a rainbow triangle

DOI10.1016/j.ejc.2017.06.022zbMath1369.05078OpenAlexW2738179066MaRDI QIDQ2403696

Hanno Lefmann, Knut Odermann, Carlos Hoppen

Publication date: 11 September 2017

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2017.06.022

zbMATH Keywords

regularity lemma\(r\)-edge-colorings

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (14)

Remarks on an edge-coloring problem ⋮ Integer colorings with no rainbow \(k\)-term arithmetic progression ⋮ Integer colorings with forbidden rainbow sums ⋮ A Rainbow Erdös--Rothschild Problem ⋮ Edge-colorings avoiding patterns in a triangle ⋮ Extremal problems and results related to Gallai-colorings ⋮ Monochromatic stars in rainbow \(K_3\)-free and \(S_3^+\)-free 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 ⋮ Rainbow triangles in arc-colored tournaments ⋮ Counting Gallai 3-colorings of complete graphs ⋮ The number of Gallai \(k\)-colorings of complete graphs ⋮ Disproof of a conjecture on the rainbow triangles in arc-colored digraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A rainbow Erdős-Rothschild problem
• A proof of the stability of extremal graphs, Simonovits' stability from Szemerédi's regularity
• Edge-colorings avoiding a fixed matching with a prescribed color pattern
• Edge-colorings of graphs avoiding complete graphs with a prescribed coloring
• A remark on the number of edge colorings of graphs
• Edge-colorings of graphs avoiding fixed monochromatic subgraphs with linear Turán number
• Edge Colourings of Graphs Avoiding Monochromatic Matchings of a Given Size
• The maximum number of K ₃ -free and K ₄ -free edge 4-colorings
• THE NUMBER OF EDGE COLORINGS WITH NO MONOCHROMATIC CLIQUES
• The Erdős–Rothschild problem on edge-colourings with forbidden monochromatic cliques

This page was built for publication: On graphs with a large number of edge-colorings avoiding a rainbow triangle