The investigation of conditions guaranteeing the appearance of cycles of certain lengths is one of the most well-studied topics in graph theory. In this paper we consider a problem of this type which asks, for fixed integers ` and k, how many copies of the k-cycle guarantee the appearance of an `-cycle? Extending previous results of Bollobás-Gyori-Li and Alon-Shikhelman, we fully resolve this problem by giving tight (or nearly tight) bounds for all values of ` and k. We also present a somewhat surprising application of the above mentioned estimates to the study of graph property testing. Prior to this work, all bounds for the query complexity of testing graph properties were either polynomial or there was a tower-type gap between the best known upper and lower bounds. We fill this gap by showing that for every super-polynomial function f(e), there is a monotone graph property P, such that the query complexity of the optimal one-sided-error e-tester for P is precisely given by f(e). We thus obtain the first examples of tight super-polynomial bounds for the one-sided-error query complexity of graph properties. A special case of this result resolves a problem of Alon and the second author, while another special case partially resolves a problem of Goldreich.
|Number of pages||4|
|State||Published - 2019|
|Event||16th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, CTW 2018 - Paris, France|
Duration: 18 Jun 2018 → 20 Jun 2018
|Conference||16th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, CTW 2018|
|Period||18/06/18 → 20/06/18|