The maximum number of K 3 -free and K 4 -free edge 4-colorings

DOI10.1112/JLMS/JDR031zbMath1242.05135OpenAlexW2128292580WikidataQ105584979 ScholiaQ105584979MaRDI QIDQ2890303

Oleg Pikhurko, Zelealem B. Yilma

Publication date: 8 June 2012

Published in: Journal of the London Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1112/jlms/jdr031

Mathematics Subject Classification ID

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

Related Items (28)

Edge-colorings of graphs avoiding complete graphs with a prescribed coloring ⋮ Stability for the Erdős-Rothschild problem ⋮ Remarks on an edge-coloring problem ⋮ Edge-colorings avoiding a fixed matching with a prescribed color pattern ⋮ Counting H-free orientations of graphs ⋮ Edge-colorings avoiding fixed rainbow stars ⋮ Maximum number of sum-free colorings in finite abelian groups ⋮ Improved Bound on the Maximum Number of Clique-Free Colorings with Two and Three Colors ⋮ On graphs with a large number of edge-colorings avoiding a rainbow triangle ⋮ On the maximum number of integer colourings with forbidden monochromatic sums ⋮ Uniform hypergraphs with many edge‐colorings avoiding a fixed rainbow expanded complete graph ⋮ On Two Problems in Ramsey--Turán Theory ⋮ Integer colorings with forbidden rainbow sums ⋮ Hypergraphs with many Kneser colorings ⋮ A Rainbow Erdös--Rothschild Problem ⋮ The Erdős–Rothschild problem on edge-colourings with forbidden monochromatic cliques ⋮ Exact solutions to the Erdős-Rothschild problem ⋮ Edge-colorings avoiding patterns in a triangle ⋮ Edge-colorings of uniform hypergraphs avoiding monochromatic matchings ⋮ Colourings without monochromatic disjoint pairs ⋮ Edge colorings of graphs without monochromatic stars ⋮ Unnamed Item ⋮ An analytic approach to stability ⋮ An extension of the rainbow Erdős-Rothschild problem ⋮ Edge-colorings of graphs avoiding fixed monochromatic subgraphs with linear Turán number ⋮ Rainbow Erdös--Rothschild Problem for the Fano Plane ⋮ A coloring problem for intersecting vector spaces ⋮ Colouring set families without monochromatic \(k\)-chains

This page was built for publication: The maximum number of K ₃ -free and K ₄ -free edge 4-colorings