On the Ramsey multiplicity of complete graphs

Details On the Ramsey multiplicity of complete graphs On the Ramsey multiplicity of complete graphs

2007-11-30

arxiv.org/abs/0711.4999v1

Mathematics

Combinatorics

15 pages

Scientific paper

We show that, for $n$ large, there must exist at least
\[\frac{n^t}{C^{(1+o(1))t^2}}\] monochromatic $K_t$s in any two-colouring of
the edges of $K_n$, where $C \approx 2.18$ is an explicitly defined constant.
The old lower bound, due to Erd\H{o}s \cite{E62}, and based upon the standard
bounds for Ramsey's theorem, is \[\frac{n^t}{4^{(1+o(1))t^2}}.\]

Affiliated with

Also associated with

No associations

Rating

On the Ramsey multiplicity of complete 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 On the Ramsey multiplicity of complete graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the Ramsey multiplicity of complete graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-703241