Graphs and Combinatorics

, Volume 3, Issue 1, pp 67–73 | Cite as

Linear upper bounds for local Ramsey numbers

  • Miroslaw Truszczynski
  • Zsolt Tuza


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.


Complete Graph Distinct Color Ramsey Number Monochromatic Copy Number Fork 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 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. 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. 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. 4.
    Gyárfás, A., Lehel, J., Schelp, R.H., Tuza, Zs.: Ramsey numbers for local colorings. Graphs and Combinatorics (to appear)Google Scholar

Copyright information

© Springer-Verlag 1987

Authors and Affiliations

  • Miroslaw Truszczynski
    • 1
  • Zsolt Tuza
    • 2
  1. 1.Department of Computer ScienceUniversity of KentuckyLexingtonUSA
  2. 2.Computer and Automation InstituteHungarian Academy of SciencesBudapestHungary

Personalised recommendations