Linear upper bounds for local Ramsey numbers
A coloring of the edges of a graph is called alocal k-coloring if every vertex is incident to edges of at mostk distinct colors. For a given graphG, thelocal Ramsey number, r loc k (G), is the smallest integern such that any localk-coloring ofK n , (the complete graph onn vertices), contains a monochromatic copy ofG. The following conjecture of Gyárfás et al. is proved here: for each positive integerk there exists a constantc = c(k) such thatr loc k (G) ≤ cr k (G), for every connected grraphG (wherer k (G) is theusual Ramsey number fork colors). Possible generalizations for hypergraphs are considered.
KeywordsComplete Graph Distinct Color Ramsey Number Monochromatic Copy Number Fork
Unable to display preview. Download preview PDF.
- 1.Chvátal, V., Rödl, V., Szemerédi, E., Trotter, W.T.: The Ramsey number of a graph with bounded maximum degree. J. Comb. Theory (B)34, 239–243 (1983)Google Scholar
- 2.Erdös, P., Kleitman, D.J.: On coloring graphs to maximize the proportion of multicoloredk-edges. J. Comb. Theory5, 164–169 (1968)Google Scholar
- 3.Gyárfás, A., Lehel, J., Nešetřil, J., Rödl, V., Schelp, R.H., Tuza, Zs.: Localk-colorings of graphs and hypergraphs. J. Comb. Theory (B) (to appear).Google Scholar
- 4.Gyárfás, A., Lehel, J., Schelp, R.H., Tuza, Zs.: Ramsey numbers for local colorings. Graphs and Combinatorics (to appear)Google Scholar