It is shown that the Ramsey number of any graph with n vertices in which no two vertices of degree at least 3 are adjacent is at most 12n. In particular, the above estimate holds for the Ramsey number of any n‐vertex subdivision of an arbitrary graph, provided each edge of the original graph is subdivided at least once. This settles a problem of Burr and Erdös.
|Original language||English (US)|
|Number of pages||5|
|Journal||Journal of Graph Theory|
|State||Published - Jul 1994|
All Science Journal Classification (ASJC) codes
- Geometry and Topology