Balanced edge-colorings avoiding rainbow cliques of size four

DOI10.37236/11965zbMath1527.05062arXiv2303.15476OpenAlexW4385892091MaRDI QIDQ6133158

Felix Christian Clemen, Adam Zsolt Wagner

Publication date: 18 August 2023

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

complete graphsbalancedrainbow coloringedge-colorings

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• On restricted colourings of \(K_ n\)
• Random subgraphs of properly edge-coloured complete graphs and long rainbow cycles
• Rainbow Turán Problems
• Rainbow subgraphs in properly edge‐colored graphs
• Properly colored subgraphs and rainbow subgraphs in edge‐colorings with local constraints
• Local Anti-Ramsey Numbers of Graphs
• An anti-Ramsey theorem

This page was built for publication: Balanced edge-colorings avoiding rainbow cliques of size four