On the size of hereditary classes of graphs
Journal of Combinatorial Theory Series B
Ramsey properties of random hypergraphs
Journal of Combinatorial Theory Series A
Extremal problems on set systems
Random Structures & Algorithms
Regularity properties for triple systems
Random Structures & Algorithms
On characterizing hypergraph regularity
Random Structures & Algorithms - Special issue: Proceedings of the tenth international conference "Random structures and algorithms"
Regularity properties for triple systems
Random Structures & Algorithms
An Algorithmic Version of the Hypergraph Regularity Method
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
The counting lemma for regular k-uniform hypergraphs
Random Structures & Algorithms
Hereditary properties of hypergraphs
Journal of Combinatorial Theory Series B
The structure of almost all graphs in a hereditary property
Journal of Combinatorial Theory Series B
Complete Partite subgraphs in dense hypergraphs
Random Structures & Algorithms
Hi-index | 0.00 |
For an integer $s\ges 2$, a property $\P^{(s)}$ is an infinite class of s-uniform hypergraphs closed under isomorphism. We say that a property $\P^{(s)}$ is \emph{hereditary\/} if~$\P^{(s)}$ is closed under taking induced subhypergraphs. Thus, for some `forbidden class' $\FF=\{\F_i^{(s)}\:i\in I\}$ of s-uniform hypergraphs, $\P^{(s)}$ is the set of all s-uniform hypergraphs not containing any $\F_i^{(s)}\in\FF$ as an induced subhypergraph. Let $\P^{(s)}_n$ be those hypergraphs of $\P^{(s)}$ on some fixed n-vertex set. For a set of s-uniform hypergraphs $\FF=\{\F_i^{(s)}\:i\in I\}$, let\[ \exind(n,\FF)=\max\bigl|[n]^s{\setminus}(\M\cup\N)\vphantom{\big|}\bigr|, \]where the maximum is taken over all $\M$ and $\N\subseteq[n]^s$ with $\M\cap\N=\emptyset$ such that, for all $\G\subseteq[n]^s{\setminus}(\M\cup\N)$, no $\F_i^{(s)}\in\FF$ appears as an induced subhypergraph of $\G\cup\M$. We show that\[ \log_2\big|\P^{(3)}_n\big|=\exind(n,\FF)+o(n^3) \]holds for $s=3$ and any hereditary property $\P^{(3)}$, where $\FF$ is a forbidden class associated with $\P^{(3)}$. This result complements a collection of analogous theorems already proved for graphs (i.e., $s=2$).