Improved Bound on the Maximum Number of Clique-Free Colorings with Two and Three Colors

DOI10.1137/17M1130502zbMath1388.05066OpenAlexW2808098300WikidataQ129700072 ScholiaQ129700072MaRDI QIDQ4568091

Hiệp Hàn, Andrea Jiménez

Publication date: 15 June 2018

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/17m1130502

zbMATH Keywords

edge coloringscontainer methodclique-free coloringsErdős-Rothschild type problems

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (8)

Stability for the Erdős-Rothschild problem ⋮ Remarks on an edge-coloring problem ⋮ Edge-colorings avoiding patterns in a triangle ⋮ Graphs with many edge-colorings such that complete graphs are rainbow ⋮ 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
• Hypergraph containers
• The typical structure of graphs with no large cliques
• Lower bounds of tower type for Szemerédi's uniformity lemma
• Maximum number of sum-free colorings in finite abelian groups
• The maximum number of K ₃ -free and K ₄ -free edge 4-colorings
• THE NUMBER OF EDGE COLORINGS WITH NO MONOCHROMATIC CLIQUES
• On the Number of Graphs Without Large Cliques
• Independent sets in hypergraphs
• The Erdős–Rothschild problem on edge-colourings with forbidden monochromatic cliques

This page was built for publication: Improved Bound on the Maximum Number of Clique-Free Colorings with Two and Three Colors