Edge-colorings avoiding patterns in a triangle

DOI10.1016/j.disc.2024.113896arXiv2209.06991WikidataQ129445416 ScholiaQ129445416MaRDI QIDQ6197754

Carlos Hoppen, Hanno Lefmann, Dionatan Ricardo Schmidt

Publication date: 19 February 2024

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2209.06991

zbMATH Keywords

edge coloringextremal graph theoryErdős-Rothchild problem

Mathematics Subject Classification ID

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

Cites Work

• A proof of the stability of extremal graphs, Simonovits' stability from Szemerédi's regularity
• The number of Gallai \(k\)-colorings of complete graphs
• An extension of the rainbow Erdős-Rothschild problem
• Remarks on an edge-coloring problem
• Edge-colorings of graphs avoiding complete graphs with a prescribed coloring
• On graphs with a large number of edge-colorings avoiding a rainbow triangle
• The number of oriantations having no fixed tournament
• 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
• A Rainbow Erdös--Rothschild Problem
• THE NUMBER OF EDGE COLORINGS WITH NO MONOCHROMATIC CLIQUES
• The Typical Structure of Gallai Colorings and Their Extremal Graphs
• Exact solutions to the Erdős-Rothschild problem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Edge-colorings avoiding patterns in a triangle