Random subgraphs of properly edge-coloured complete graphs and long rainbow cycles |
| |
Authors: | Noga Alon Alexey Pokrovskiy Benny Sudakov |
| |
Institution: | 1.Department of Pure Mathematics and Mathematical Statistics,University of Cambridge,Cambridge,UK |
| |
Abstract: | We study the upper tail of the number of arithmetic progressions of a given length in a random subset of {1,..., n}, establishing exponential bounds which are best possible up to constant factors in the exponent. The proof also extends to Schur triples, and, more generally, to the number of edges in random induced subhypergraphs of ‘almost linear’ k-uniform hypergraphs. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|