Title of article
Hereditary properties of hypergraphs
Author/Authors
Dotson، نويسنده , , Ryan and Nagle، نويسنده , , Brendan، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2009
Pages
14
From page
460
To page
473
Abstract
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 Turán-type function concerning forbidden induced sub-hypergraphs. This result complements several existing theorems for hereditary and monotone graph and hypergraph properties.
Keywords
Hereditary hypergraph properties , Hypergraph regularity lemma , Hypergraph counting lemma
Journal title
Journal of Combinatorial Theory Series B
Serial Year
2009
Journal title
Journal of Combinatorial Theory Series B
Record number
1528842
Link To Document