Extremal problems and results related to Gallai-colorings
From MaRDI portal
Publication:1981696
DOI10.1016/j.disc.2021.112567zbMath1472.05056arXiv2006.04879OpenAlexW3187795877MaRDI QIDQ1981696
Xihe Li, Li-Gong Wang, Hajo J. Broersma
Publication date: 6 September 2021
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2006.04879
regularity lemmaRamsey multiplicityrainbow triangleGallai-Ramsey theorymonochromatic copy of a graph
Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Ramsey theory (05D10)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- On the Ramsey multiplicity of complete graphs
- Monochromatic triangles in three-coloured graphs
- On edges not in monochromatic copies of a fixed bipartite graph
- Rainbow generalizations of Ramsey theory: A survey
- The number of Gallai \(k\)-colorings of complete graphs
- Edge-colored complete graphs with precisely colored subgraphs
- A note on perfect graphs
- All Ramsey numbers for five vertices and seven or eight edges
- Perfect couples of graphs
- On the number of edges not covered by monochromatic copies of a fixed graph.
- Edges not in any monochromatic copy of a fixed graph
- Gallai-Ramsey numbers of \(C_7\) with multiple colors
- The Erdős-Hajnal conjecture for rainbow triangles
- On graphs with a large number of edge-colorings avoiding a rainbow triangle
- Complete graphs and complete bipartite graphs without rainbow path
- Improved Upper Bounds for Gallai-Ramsey Numbers of Paths and Cycles
- Non-Three-Colourable Common Graphs Exist
- Extensions of Gallai-Ramsey results
- Ramsey-type results for Gallai colorings
- On Sets of Acquaintances and Strangers at any Party
- Some small ramsey numbers
- Edge colorings of complete graphs without tricolored triangles
- A Rainbow Erdös--Rothschild Problem
- Gallai‐Ramsey number for K4
- The Typical Structure of Gallai Colorings and Their Extremal Graphs
- There exist graphs with super‐exponential Ramsey multiplicity constant
- Transitiv orientierbare Graphen
- Combinatorial Relations and Chromatic Graphs
- Graph pairs and their entropies: Modularity problems
This page was built for publication: Extremal problems and results related to Gallai-colorings
