Journal of Graph Theory · 2013 · 33 citations · 11 references
Natural SciencesComputer ScienceMathematicsAlgorithmsCombinatoricsDiscrete MathematicsCombinatorial Number TheoryCombinatorial OptimizationEnumerative CombinatoricsGraph AlgorithmsGraph ColoringGraph TheoryColoring TheoremsEdge ColoringUpper Bounds
Given a graph G and a positive integer k, define the Gallai–Ramsey number to be the minimum number of vertices n such that any k-edge coloring of contains either a rainbow (all different colored) triangle or a monochromatic copy of G. In this work, we improve upon known upper bounds on the Gallai–Ramsey numbers for paths and cycles. All these upper bounds now have the best possible order of magnitude as functions of k.
11
Edge-colored complete graphs with precisely colored subgraphs
Fan Chung, R. L. Graham · COMBINATORICA · 1983 · 93 citations