Remarks on an edge-coloring problem

DOI10.1016/J.ENTCS.2019.08.045OpenAlexW2977837749WikidataQ113317386 ScholiaQ113317386MaRDI QIDQ2132387

Hanno Lefmann, Carlos Hoppen

Publication date: 27 April 2022

Full work available at URL: https://doi.org/10.1016/j.entcs.2019.08.045

zbMATH Keywords

Turán problemedge-coloringsErdős-Rothschild problem

Mathematics Subject Classification ID

Mathematical programming (90Cxx) Graph theory (05Cxx)

Related Items (3)

Edge-colorings avoiding patterns in a triangle ⋮ Graphs with many edge-colorings such that complete graphs are rainbow ⋮ An extension of the rainbow Erdős-Rothschild problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A proof of the stability of extremal graphs, Simonovits' stability from Szemerédi's regularity
• Edge-colorings avoiding a fixed matching with a prescribed color pattern
• Maximum number of sum-free colorings in finite abelian groups
• Colourings without monochromatic disjoint pairs
• Counting Gallai 3-colorings of complete graphs
• Colouring set families without monochromatic \(k\)-chains
• Edge-colorings of graphs avoiding complete graphs with a prescribed coloring
• A remark on the number of edge colorings of graphs
• 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
• The Erdős–Rothschild problem on edge-colourings with forbidden monochromatic cliques
• The History of Degenerate (Bipartite) Extremal Graph Problems

This page was built for publication: Remarks on an edge-coloring problem