The Ramsey number of dense graphs

Details The Ramsey number of dense graphs The Ramsey number of dense graphs

2009-07-15

arxiv.org/abs/0907.2657v1

Mathematics

Combinatorics

15 pages

Scientific paper

The Ramsey number r(H) of a graph H is the smallest number n such that, in any two-colouring of the edges of K_n, there is a monochromatic copy of H. We study the Ramsey number of graphs H with t vertices and density \r, proving that r(H) \leq 2^{c \sqrt{\r} \log (2/\r) t}. We also investigate some related problems, such as the Ramsey number of graphs with t vertices and maximum degree \r t and the Ramsey number of random graphs in \mathcal{G}(t, \r), that is, graphs on t vertices where each edge has been chosen independently with probability \r.

Affiliated with

Also associated with

No associations

Rating

The Ramsey number of dense graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The Ramsey number of dense graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Ramsey number of dense graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-365035