The edge-statistics conjecture for ℓ ≪ k6/5

Autor: Anders Martinsson, Miloš Trujić, Frank Mousset, Andreas Noever
Rok vydání: 2019
Předmět:
Zdroj: Israel Journal of Mathematics. 234:677-690
ISSN: 1565-8511
0021-2172
Popis: Let k and l be positive integers. We prove that if 1 ≤ l ≤ Ok(k6/5), then in every large enough graph G, the fraction of k-vertex subsets that induce exactly l edges is at most 1/e + ok(1). Together with a recent result of Kwan, Sudakov and Tran, this settles a conjecture of Alon, Hefetz, Krivelevich and Tyomkyn.
Databáze: OpenAIRE
Externí odkaz: