Gallai-Ramsey multiplicity for rainbow small trees
From MaRDI portal
(Redirected from Publication:6598014)
Gallai-Ramsey multiplicity for rainbow small trees (scientific article; zbMATH DE number 7906417)
Gallai-Ramsey multiplicity for rainbow small trees (scientific article; zbMATH DE number 7906417)
Recommendations
Cites work
- Complete bipartite graphs without small rainbow stars
- Complete graphs and complete bipartite graphs without rainbow path
- Complete graphs with no rainbow path
- Complete graphs with no rainbow tree
- Extensions of Gallai-Ramsey results
- Extremal problems and results related to Gallai-colorings
- Forbidden rainbow subgraphs that force large monochromatic or multicolored \(k\)-connected subgraphs
- Gallai-Ramsey Multiplicity
- Gallai-Ramsey number for \(K_4\)
- Gallai-Ramsey numbers for rainbow \(S_3^+\) and monochromatic paths
- Gallai-Ramsey numbers for rainbow paths
- Gallai-Ramsey numbers involving a rainbow 4-path
- Gallai–Ramsey number for K5 ${K}_{5}$
- Graph theory
- scientific article; zbMATH DE number 5717204 (Why is no real title available?)
- Monochromatic stars in rainbow \(K_3\)-free and \(S_3^+\)-free colorings
- On a problem of formal logic.
- Rainbow generalizations of Ramsey theory: A survey
- Ramsey and Gallai-Ramsey numbers for the union of paths and stars
- Ramsey numbers for local colorings
- Ramsey-type results for Gallai colorings
- Small Ramsey numbers
- Subgraph counting identities and Ramsey numbers
- The Erdős-Hajnal conjecture for rainbow triangles
- The Erdős–Gyárfás function with respect to Gallai‐colorings
- There exist graphs with super‐exponential Ramsey multiplicity constant
- Topics in Gallai-Ramsey Theory
Cited in
(3)
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)
