Graphs with many edge-colorings such that complete graphs are rainbow
From MaRDI portal
Publication:2700627
DOI10.1016/j.dam.2023.03.012OpenAlexW4362473174MaRDI QIDQ2700627
Andy Oertel, Dionatan R. Schmidt, Hanno Lefmann, Josefran de O. Bastos, Carlos Hoppen
Publication date: 27 April 2023
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2023.03.012
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
- The number of Gallai \(k\)-colorings of complete graphs
- Edge colorings of graphs without monochromatic stars
- An extension of the rainbow Erdős-Rothschild problem
- Remarks on an edge-coloring problem
- A remark on the number of edge colorings of graphs
- The number of oriantations having no fixed tournament
- Edge-colorings of graphs avoiding fixed monochromatic subgraphs with linear Turán number
- Improved Bound on the Maximum Number of Clique-Free Colorings with Two and Three Colors
- A Rainbow Erdös--Rothschild Problem
- Edge‐colorings avoiding rainbow stars
- THE NUMBER OF EDGE COLORINGS WITH NO MONOCHROMATIC CLIQUES
- The Typical Structure of Gallai Colorings and Their Extremal Graphs