Gallai-Ramsey multiplicity for rainbow small trees
From MaRDI portal
Publication:6598014
DOI10.1007/S00373-024-02819-ZzbMATH Open1546.05098MaRDI QIDQ6598014FDOQ6598014
Publication date: 4 September 2024
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Coloring of graphs and hypergraphs (05C15) Enumeration in graph theory (05C30) Generalized Ramsey theory (05C55) Ramsey theory (05D10)
Cites Work
- Graph theory
- Rainbow generalizations of Ramsey theory: A survey
- Small Ramsey numbers
- Ramsey-type results for Gallai colorings
- The Erdős–Gyárfás function with respect to Gallai‐colorings
- Extensions of Gallai-Ramsey results
- There exist graphs with super‐exponential Ramsey multiplicity constant
- Title not available (Why is that?)
- Ramsey numbers for local colorings
- Complete graphs with no rainbow path
- The Erdős-Hajnal conjecture for rainbow triangles
- On a problem of formal logic.
- Gallai‐Ramsey number for K4
- Gallai-Ramsey numbers involving a rainbow 4-path
- Subgraph counting identities and Ramsey numbers
- Ramsey and Gallai-Ramsey numbers for the union of paths and stars
- Extremal problems and results related to Gallai-colorings
- Complete graphs and complete bipartite graphs without rainbow path
- Monochromatic stars in rainbow \(K_3\)-free and \(S_3^+\)-free colorings
- Gallai-Ramsey numbers for rainbow \(S_3^+\) and monochromatic paths
- Gallai-Ramsey numbers for rainbow paths
- Complete graphs with no rainbow tree
- Topics in Gallai-Ramsey Theory
- Gallai–Ramsey number for K5 ${K}_{5}$
- Forbidden rainbow subgraphs that force large monochromatic or multicolored \(k\)-connected subgraphs
- Complete bipartite graphs without small rainbow stars
- Gallai-Ramsey Multiplicity
This page was built for publication: Gallai-Ramsey multiplicity for rainbow small trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6598014)
