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

DOI10.1137/17M1130502zbMATH Open1388.05066OpenAlexW2808098300WikidataQ129700072 ScholiaQ129700072MaRDI QIDQ4568091FDOQ4568091

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

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

zbMATH Keywords

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

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

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

Cited In (13)

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

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)