Clique-width and the speed of hereditary properties
The electronic journal of combinatorics, Tome 16 (2009) no. 1
In this paper, we study the relationship between the number of $n$-vertex graphs in a hereditary class $\cal X$, also known as the speed of the class $\cal X$, and boundedness of the clique-width in this class. We show that if the speed of $\cal X$ is faster than $n!c^n$ for any $c$, then the clique-width of graphs in $\cal X$ is unbounded, while if the speed does not exceed the Bell number $B_n$, then the clique-width is bounded by a constant. The situation in the range between these two extremes is more complicated. This area contains both classes of bounded and unbounded clique-width. Moreover, we show that classes of graphs of unbounded clique-width may have slower speed than classes where the clique-width is bounded.
DOI :
10.37236/124
Classification :
05C75, 05C69, 05C85, 05A16
Mots-clés : clique-width, hereditary class of graphs, speed of hereditary classes, rates of growth, discrete layers
Mots-clés : clique-width, hereditary class of graphs, speed of hereditary classes, rates of growth, discrete layers
@article{10_37236_124,
author = {Peter Allen and Vadim Lozin and Micha\"el Rao},
title = {Clique-width and the speed of hereditary properties},
journal = {The electronic journal of combinatorics},
year = {2009},
volume = {16},
number = {1},
doi = {10.37236/124},
zbl = {1182.05101},
url = {http://geodesic.mathdoc.fr/articles/10.37236/124/}
}
Peter Allen; Vadim Lozin; Michaël Rao. Clique-width and the speed of hereditary properties. The electronic journal of combinatorics, Tome 16 (2009) no. 1. doi: 10.37236/124
Cité par Sources :