Journal article
The Ramsey number of dense graphs
- Abstract:
- The Ramsey number r(H) of a graph H is the smallest number n such that, in any two-colouring of the edges of Kn, there is a monochromatic copy of H. We study the Ramsey number of graphs H with t vertices and density p, proving that r(H) ≤2c √plog(2/p)t. We also investigate some related problems, such as the Ramsey number of graphs with t vertices and maximum degree pt and the Ramsey number of random graphs in G(t,p), that is, graphs on t vertices where each edge has been chosen independently with probability p.
- Publication status:
- Published
- Peer review status:
- Peer reviewed
Actions
Authors
Bibliographic Details
- Publisher:
- London Mathematical Society Publisher's website
- Journal:
- Bulletin of the London Mathematical Society Journal website
- Volume:
- 45
- Issue:
- 3
- Pages:
- 483-496
- Publication date:
- 2012-12-20
- Acceptance date:
- 2012-09-19
- DOI:
- EISSN:
-
1469-2120
- ISSN:
-
0024-6093
Item Description
- Keywords:
- Pubs id:
-
pubs:196709
- UUID:
-
uuid:c655f624-b586-4865-8d81-046d3aee341d
- Local pid:
- pubs:196709
- Source identifiers:
-
196709
- Deposit date:
- 2016-11-21
Terms of use
- Copyright holder:
- London Mathematical Society
- Copyright date:
- 2012
- Notes:
- This is the author accepted manuscript following peer review version of the article. The final version is available online from London Mathematical Society.
Metrics
If you are the owner of this record, you can report an update to it here: Report update to this record