On the Ramsey multiplicity of complete graphs
| dc.creator | Conlon, David | |
| dc.date | 2007-11-30 | |
| dc.date.accessioned | 2026-07-07T08:46:28Z | |
| dc.date.available | 2026-07-07T08:46:28Z | |
| dc.description | 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ős \cite{E62}, and based upon the standard bounds for Ramsey's theorem, is \[\frac{n^t}{4^{(1+o(1))t^2}}.\] | |
| dc.description | 15 pages | |
| dc.identifier | https://arxiv.org/abs/0711.4999 | |
| dc.identifier | http://arxiv.org/abs/0711.4999 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/143262 | |
| dc.subject | Combinatorics | |
| dc.subject | 05C55 | |
| dc.title | On the Ramsey multiplicity of complete graphs | |
| dc.type | text |