Deciding the Bell number for hereditary graph properties

Atminas, A, Collins, A, Foniok, J and Lozin, VV (2014) Deciding the Bell number for hereditary graph properties. In: 40th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2014), 25 June 2014 - 27 June 2014, Nouan-le-Fuzelier, France.

Preview

Available under License In Copyright. Download (466kB) | Preview

Abstract

© Springer International Publishing Switzerland 2014. The paper [J. Balogh, B. Bollobás, D. Weinreich, A jump to the Bell number for hereditary graph properties, J. Combin. Theory Ser. B 95 (2005) 29–48] identifies a jump in the speed of hereditary graph properties to the Bell number Bn and provides a partial characterisation of the family of minimal classes whose speed is at least Bn. In the present paper, we give a complete characterisation of this family. Since this family is infinite, the decidability of the problem of determining if the speed of a hereditary property is above or below the Bell number is questionable. We answer this question positively for properties defined by finitely many forbidden induced subgraphs. In other words, we show that there exists an algorithm which, given a finite set F of graphs, decides whether the speed of the class of graphs containing no induced subgraphs from the set F is above or below the Bell number.