Vertex colorings of graphs without short odd cycles

Motivated by the work of Nesetřil and Rodl on “Partitions of vertices” we are interested in obtaining some quantitative extensions of their result. In particular, given a natural number r and a graph G of order m with odd girth g, we show the existence of a graph H with odd girth at least g and order that is polynomial in m such that every r-coloring of the vertices of H yields a monochromatic and induced copy of G. © 2010 Wiley Periodicals, Inc. J Graph Theory 68: 255-264, 2011 © 2011 Wiley Periodicals, Inc.

[1]  Svante Janson,et al.  Random graphs , 2000, Wiley-Interscience series in discrete mathematics and optimization.

[2]  Joseph A. Thas,et al.  Chapter 9 – Generalized Polygons , 1995 .

[3]  On v1×v2(n, s, t) configurations , 1969 .

[4]  Andrzej Dudek,et al.  New Upper Bound on Vertex Folkman Numbers , 2008, LATIN.

[5]  Norbert Sauer.  On the existence of regular n-graphs with given girth , 1970 .

[6]  L. Lovász.  On chromatic number of finite set-systems , 1968 .

[7]  P. Erdös,et al.  Graph Theory and Probability , 1959 .

[8]  Andrzej Dudek,et al.  An almost quadratic bound on vertex Folkman numbers , 2010, J. Comb. Theory, Ser. B.

[9]  P. Erdös.  Graph Theory and Probability. II , 1961, Canadian Journal of Mathematics.

[10]  P. Erdos,et al.  On chromatic number of graphs and set-systems , 1966 .