A General Lower Bound on Gallai-Ramsey Numbers for Non-Bipartite Graphs
Work
Year: 2018
Type: article
Abstract: Given a graph $H$ and a positive integer $k$, the $k$-color Gallai-Ramsey number $gr_{k}(K_{3} : H)$ is defined to be the minimum number of vertices $n$ for which any $k$-coloring of the complete grap... more
Author Colton Magnant
Institution Georgia Southern University
Cites: 9
Cited by: 9
Related to: 10
FWCI: 1.887
Citation percentile (by year/subfield): 79.76
Subfield: Discrete Mathematics and Combinatorics
Field: Mathematics
Domain: Physical Sciences
Open Access status: diamond