Andrzej Nowik

Learn More
For given finite family of graphs G) is the smallest integer n such that if we arbitrarily color the edges of the complete graph on n vertices with k colors then there is always a monochromatic copy of G i colored with i, for some 1 ≤ i ≤ k. We give a lower bound for k−color Ramsey number R(C m , C m ,. .. , C m), where m ≥ 4 is even and C m is the cycle on(More)
  • 1