Maximum number of triangle-free edge colourings with five and six colours

MaRDI QIDQ6621168FDO

Authors F. Botler, Jan Corsten, A. Dankovics, Nóra Frankl, Hiệp Hàn, Andrea Jiménez, J. Skokan

Publication date 18 October 2024

Published in Acta Mathematica Universitatis Comenianae. New Series (Search for Journal in Brave)

Mathematics Subject Classification ID

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

Recommendations

• Remarks on an edge-coloring problem
• 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 NUMBER OF EDGE COLORINGS WITH NO MONOCHROMATIC CLIQUES
• Edge-colorings avoiding patterns in a triangle

Cites work

• scientific article; zbMATH DE number 3652373 (Why is no real title available?)
• scientific article; zbMATH DE number 3487496 (Why is no real title available?)
• scientific article; zbMATH DE number 554066 (Why is no real title available?)
• scientific article; zbMATH DE number 881297 (Why is no real title available?)
• A proof of the stability of extremal graphs, Simonovits' stability from Szemerédi's regularity
• Colourings without monochromatic disjoint pairs
• Eine Extremalaufgabe aus der Graphentheorie.
• Hypergraph containers
• Improved bound on the maximum number of clique-free colorings with two and three colors
• Independent sets in hypergraphs
• 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

Cited in

(1)

• Edge-colorings avoiding patterns in a triangle

This page was built for publication: Maximum number of triangle-free edge colourings with five and six colours

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