Name
Abstract | ||
|---|---|---|
Motivated by the work of Nešetřil and Rödl 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. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1002/jgt.20557 | Journal of Graph Theory |
Keywords | Field | DocType |
vertex colorings,odd girth g,odd girth,wiley periodicals,induced copy,quantitative extension,inc. j graph theory,order m,short odd cycle,graph g,graph h,natural number r | Odd graph,Discrete mathematics,Wheel graph,Combinatorics,Graph power,Vertex (graph theory),Graph homomorphism,Cycle graph,Neighbourhood (graph theory),Symmetric graph,Mathematics | Journal |
Volume | Issue | ISSN |
68 | 3 | 0364-9024 |
Citations | PageRank | References |
0 | 0.34 | 2 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Andrzej Dudek | 1 | 114 | 23.10 |
| Reshma Ramadurai | 2 | 17 | 3.32 |