Edge-colorings of graphs avoiding fixed monochromatic subgraphs with linear Turán number

DOI10.1016/J.EJC.2013.06.027zbMath1296.05071OpenAlexW2048147719WikidataQ105583662 ScholiaQ105583662MaRDI QIDQ2509762

Yoshiharu Kohayakawa, Hanno Lefmann, Carlos Hoppen

Publication date: 29 July 2014

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

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

zbMATH Keywords

extremal graphs for some forbidden graphs

Mathematics Subject Classification ID

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

Related Items (18)

Edge-colorings of graphs avoiding complete graphs with a prescribed coloring ⋮ Stability for the Erdős-Rothschild problem ⋮ Edge-colorings avoiding a fixed matching with a prescribed color pattern ⋮ Integer colorings with no rainbow \(k\)-term arithmetic progression ⋮ A rainbow Erdős-Rothschild problem ⋮ Edge-colorings avoiding fixed rainbow stars ⋮ On graphs with a large number of edge-colorings avoiding a rainbow triangle ⋮ On the maximum number of integer colourings with forbidden monochromatic sums ⋮ Integer colorings with forbidden rainbow sums ⋮ A Rainbow Erdös--Rothschild Problem ⋮ The Erdős–Rothschild problem on edge-colourings with forbidden monochromatic cliques ⋮ Graphs with many edge-colorings such that complete graphs are rainbow ⋮ Edge-colorings of uniform hypergraphs avoiding monochromatic matchings ⋮ Colourings without monochromatic disjoint pairs ⋮ Edge colorings of graphs without monochromatic stars ⋮ An extension of the rainbow Erdős-Rothschild problem ⋮ Rainbow Erdös--Rothschild Problem for the Fano Plane ⋮ Colouring set families without monochromatic \(k\)-chains

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Hypergraphs with many Kneser colorings
• A structural result for hypergraphs with many restricted edge colorings
• Asymptotic solution for a new class of forbidden r-graphs
• Some intersection theorems for ordered sets and graphs
• Path Ramsey numbers in multicolorings
• Edge Colourings of Graphs Avoiding Monochromatic Matchings of a Given Size
• The maximum number of K ₃ -free and K ₄ -free edge 4-colorings
• A Remark on Stirling's Formula
• On maximal paths and circuits of graphs
• 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
• On a problem of K. Zarankiewicz

This page was built for publication: Edge-colorings of graphs avoiding fixed monochromatic subgraphs with linear Turán number