Locally bounded coverings and factorial properties of graphs

For a graph property X, let Xn be the number of graphs with vertex set {1,…,n} having property X, also known as the speed of X. A property X is called factorial if X is hereditary (i.e. closed under taking induced subgraphs) and nc1n≤Xn≤nc2n for some constants c1 and c2. Hereditary properties with s...

Full description

Saved in:
Bibliographic Details
Published inEuropean journal of combinatorics Vol. 33; no. 4; pp. 534 - 543
Main Authors Lozin, Vadim V., Mayhill, Colin, Zamaraev, Victor
Format Journal Article
LanguageEnglish
Published Elsevier Ltd 01.05.2012
Subjects
Bells
Combinatorial analysis
Constants
Coverings
Factorials
Graphs
Online AccessGet full text

Cover

More Information
Summary:For a graph property X, let Xn be the number of graphs with vertex set {1,…,n} having property X, also known as the speed of X. A property X is called factorial if X is hereditary (i.e. closed under taking induced subgraphs) and nc1n≤Xn≤nc2n for some constants c1 and c2. Hereditary properties with speed slower than factorial are surprisingly well structured. The situation with factorial properties is more complicated and less explored. Only the properties with speeds up to the Bell number are well studied and well behaved. To better understand the behavior of factorial properties with faster speeds we introduce a structural tool called locally bounded coverings and show that a variety of graph properties can be described by means of this tool.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0195-6698
1095-9971
DOI:10.1016/j.ejc.2011.10.006