Ramsey and Gallai-Ramsey numbers for the union of paths and stars
From MaRDI portal
Publication:2104951
Recommendations
Cites work
- All partitions have small parts -- Gallai-Ramsey numbers of bipartite graphs
- All Ramsey numbers for brooms in graphs
- Complete graphs and complete bipartite graphs without rainbow path
- Complete graphs with no rainbow path
- Complete graphs with no rainbow tree
- Distribution of colors in Gallai colorings
- Edge colorings of complete graphs without tricolored triangles
- Extensions of Gallai-Ramsey results
- Gallai-Ramsey number for \(K_4\)
- Gallai-Ramsey numbers for a class of graphs with five vertices
- Gallai-Ramsey numbers for graphs with chromatic number three
- Gallai-Ramsey numbers for monochromatic triangles or 4-cycles
- Gallai-Ramsey numbers for rainbow paths
- Gallai-Ramsey numbers of odd cycles and complete bipartite graphs
- Gallai–Ramsey number for K5 ${K}_{5}$
- Generalised Ramsey numbers for small graphs
- Generalized Ramsey theory for graphs. III: Small off-diagonal numbers
- scientific article; zbMATH DE number 3693330 (Why is no real title available?)
- scientific article; zbMATH DE number 89408 (Why is no real title available?)
- scientific article; zbMATH DE number 749273 (Why is no real title available?)
- scientific article; zbMATH DE number 3262254 (Why is no real title available?)
- scientific article; zbMATH DE number 3390794 (Why is no real title available?)
- Lambda composition
- Monochromatic stars in rainbow \(K_3\)-free and \(S_3^+\)-free colorings
- On maximal paths and circuits of graphs
- On some three-color Ramsey numbers for paths
- On the multicolor Ramsey number of a graph with m edges
- Ramsey numbers for local colorings
- Ramsey numbers for matchings
- Subgraphs of Gallai-colored complete graphs spanned by edges using at most two colors
- The Erdős-Hajnal conjecture for rainbow triangles
- The Erdős–Gyárfás function with respect to Gallai‐colorings
- The Gallai-Ramsey number for a tree versus complete graphs
- The Ramsey numbers for disjoint unions of trees
- Three-color Ramsey numbers for paths
- Topics in Gallai-Ramsey Theory
- Transitiv orientierbare Graphen
Cited in
(14)- Star-path bipartite Ramsey numbers
- Ramsey and Gallai-Ramsey numbers for stars with extra independent edges
- Gallai-Ramsey number for the union of stars
- Star-critical Gallai-Ramsey numbers involving the disjoint union of triangles
- Gallai-Ramsey numbers involving a rainbow 4-path
- Size Gallai-Ramsey number
- Gallai-Ramsey multiplicity for rainbow small trees
- Gallai-Ramsey numbers for paths
- Ramsey and Gallai-Ramsey numbers for comb and sun graphs
- Ramsey and Gallai-Ramsey numbers for multiple triangles of graphs and their multiplicities
- Ramsey and Gallai-Ramsey numbers for forests
- Gallai-Ramsey numbers for rainbow trees and monochromatic complete bipartite graphs
- Gallai-Ramsey numbers for rainbow trees and monochromatic double stars or books
- Complete graphs without proper subgraphs
This page was built for publication: Ramsey and Gallai-Ramsey numbers for the union of paths and stars
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2104951)
