On the size of hereditary classes of graphs
Journal of Combinatorial Theory Series B
Extremal problems on set systems
Random Structures & Algorithms
Hereditary Properties of Triple Systems
Combinatorics, Probability and Computing
Regularity lemma for k-uniform hypergraphs
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
Quasirandomness, Counting and Regularity for 3-Uniform Hypergraphs
Combinatorics, Probability and Computing
The counting lemma for regular k-uniform hypergraphs
Random Structures & Algorithms
A variant of the hypergraph removal lemma
Journal of Combinatorial Theory Series A
Regular Partitions of Hypergraphs: Regularity Lemmas
Combinatorics, Probability and Computing
Regular Partitions of Hypergraphs: Counting Lemmas
Combinatorics, Probability and Computing
An Algorithmic Version of the Hypergraph Regularity Method
SIAM Journal on Computing
The structure of almost all graphs in a hereditary property
Journal of Combinatorial Theory Series B
Supersaturation for hereditary properties
European Journal of Combinatorics
| Hi-index | 0.00 |
A hereditary property P^(^k^) is a class of k-graphs closed under isomorphism and taking induced sub-hypergraphs. Let P"n^(^k^) denote those k-graphs of P^(^k^) on vertex set {1,...,n}. We prove an asymptotic formula for log"2|P"n^(^k^)| in terms of a Turan-type function concerning forbidden induced sub-hypergraphs. This result complements several existing theorems for hereditary and monotone graph and hypergraph properties.