Improved bound on the maximum number of clique-free colorings with two and three colors

DOI10.1137/17M1130502MaRDI QIDQ4568091zbMATH OpenOpenAlexWikidataFDO

Authors 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)

Recommendations

• THE NUMBER OF EDGE COLORINGS WITH NO MONOCHROMATIC CLIQUES
• On two problems in Ramsey-Turán theory
• The maximum number of \(K_{3}\)-free and \(K_{4}\)-free edge 4-colorings
• Edge-coloring cliques with three colors on all 4-cliques
• Two-colorings with many monochromatic cliques in both colors

Cites work

• scientific article; zbMATH DE number 3754700 (Why is no real title available?)
• scientific article; zbMATH DE number 125455 (Why is no real title available?)
• scientific article; zbMATH DE number 881297 (Why is no real title available?)
• scientific article; zbMATH DE number 3041944 (Why is no real title available?)
• Hypergraph containers
• Independent sets in hypergraphs
• Lower bounds of tower type for Szemerédi's uniformity lemma
• Maximum number of sum-free colorings in finite abelian groups
• On the number of graphs without large cliques
• THE NUMBER OF EDGE COLORINGS WITH NO MONOCHROMATIC CLIQUES
• The Erdős–Rothschild problem on edge-colourings with forbidden monochromatic cliques
• The maximum number of \(K_{3}\)-free and \(K_{4}\)-free edge 4-colorings
• The typical structure of graphs with no large cliques

Cited in

(13)

• Maximum number of triangle-free edge colourings with five and six colours
• Stability for the Erdős-Rothschild problem
• A remark on the number of edge colorings of graphs
• Remarks on an edge-coloring problem
• Convex hull of face vectors of colored complexes
• Colouring set families without monochromatic \(k\)-chains
• Graphs with many edge-colorings such that complete graphs are rainbow
• Rainbow Erdös-Rothschild problem for the Fano plane
• Edge-colorings avoiding patterns in a triangle
• The maximum number of \(K_{3}\)-free and \(K_{4}\)-free edge 4-colorings
• THE NUMBER OF EDGE COLORINGS WITH NO MONOCHROMATIC CLIQUES
• An extension of the rainbow Erdős-Rothschild problem
• Edge colorings of graphs without monochromatic stars

This page was built for publication: Improved bound on the maximum number of clique-free colorings with two and three colors

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4568091)