Subdivided graphs have linear ramsey numbers

Noga Alon*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review


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 languageEnglish
Pages (from-to)343-347
Number of pages5
JournalJournal of Graph Theory
Issue number4
StatePublished - Jul 1994


Dive into the research topics of 'Subdivided graphs have linear ramsey numbers'. Together they form a unique fingerprint.

Cite this