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

MaRDI QIDQ6621168

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

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)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A proof of the stability of extremal graphs, Simonovits' stability from Szemerédi's regularity
• Hypergraph containers
• Colourings without monochromatic disjoint pairs
• Eine Extremalaufgabe aus der Graphentheorie.
• The maximum number of K ₃ -free and K ₄ -free edge 4-colorings
• Improved Bound on the Maximum Number of Clique-Free Colorings with Two and Three Colors
• 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: Maximum number of triangle-free edge colourings with five and six colours