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

MaRDI QIDQ6621168FDOQ6621168

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)

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

Mathematics Subject Classification ID

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

Cites Work

• 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
• Title not available (Why is that?)
• THE NUMBER OF EDGE COLORINGS WITH NO MONOCHROMATIC CLIQUES
• Title not available (Why is that?)
• Title not available (Why is that?)
• A proof of the stability of extremal graphs, Simonovits' stability from Szemerédi's regularity
• On the number of graphs without large cliques
• The Erdős–Rothschild problem on edge-colourings with forbidden monochromatic cliques
• Colourings without monochromatic disjoint pairs
• Improved bound on the maximum number of clique-free colorings with two and three colors
• Eine Extremalaufgabe aus der Graphentheorie.

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)