We consider here the strong regularity for -uniform hypergraphs developed by Frankl, Gowers, Kohayakawa, Nagle, Rödl, Skokan, and Schacht. This type of regular decomposition comes with two components, a partition of the vertices, and a partition of the pairs of vertices. The data of a regular decomposition also includes two parameters measuring quasirandomness, a fixed constant , and a function . We define two growth functions associated to a hereditary property of -uniform hypergraphs: which measures the size of the vertex component, and which measures the size of the pairs component. We introduce the following question. What are the possible asymptotic growth rates of functions of the form and ? In this paper, we consider this question for , proving a separation into four classes: constant, polynomial, exponential, or at least wowzer. The separations among the constant, polynomial and exponential ranges require only slow growing (namely polynomial) choices for . The jump to the wowzer range uses a very fast growing and makes crucial use of a lower bound construction for strong graph regularity due to Conlon and Fox.

生成讲解博客的中文版本

生成AI智能校验的中文版本