The structure of almost all graphs in a hereditary property
Abstract
A hereditary property of graphs is a collection of graphs which is closed under taking induced subgraphs. The speed of P is the function n→|Pn|, where Pn denotes the graphs of order n in P. It was shown by Alekseev, and by Bollobás and Thomason, that if P is a hereditary property of graphs then. |Pn|=2(1-1/r+o(1))(n2), where r=r(P)j{cyrillic,ukrainian}N is the so-called 'colouring number' of P. However, their results tell us very little about the structure of a typical graph GεP. In this paper we describe the structure of almost every graph in a hereditary property of graphs, P. As a consequence, we derive essentially optimal bounds on the speed of P, improving the Alekseev-Bollobás-Thomason Theorem, and also generalising results of Balogh, Bollobás and Simonovits. © 2010 Elsevier Inc.
Publication Title
Journal of Combinatorial Theory. Series B
Recommended Citation
Alon, N., Balogh, J., Bollobás, B., & Morris, R. (2011). The structure of almost all graphs in a hereditary property. Journal of Combinatorial Theory. Series B, 101 (2), 85-110. https://doi.org/10.1016/j.jctb.2010.10.001
