This paper studies bounds in a strong form of regularity for -uniform hypergraphs which was developed by Frankl, Gowers, Kohayakawa, Nagle, Rödl, Skokan, and Schacht. Regular decompositions of this type involve two structural components: a partition on the vertex set and a partition on the pairs of vertices. The regularity of such decompositions are measured by two parameters: an and a function . To each hereditary property of -uniform hypergraphs, we associate two corresponding growth functions: for the size of the vertex component, and for the size of the pairs component. The problem of understanding the asymptotic growth of such functions was introduced in a companion paper, which also proved several results about . In this paper we study the possible asymptotic behavior of . We show any such function is either constant, bounded above and below by a polynomial, or bounded below by an exponential. All results require only reasonable growth rates for (namely polynomial).

生成讲解博客的中文版本

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