Deciding the Bell Number for Hereditary Graph Properties

DOI10.1137/15M1024214zbMath1336.05063OpenAlexW2622523964MaRDI QIDQ5890662

Jan Foniok, Aistis Atminas, Vadim V. Lozin, Andrew J. Collins

Publication date: 26 May 2016

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/15m1024214

zbMATH Keywords

Bell numberdecidabilityspeed of hereditary propertieshereditary class of graphs

Mathematics Subject Classification ID

Bell and Stirling numbers (11B73) Enumeration in graph theory (05C30) Structural characterization of families of graphs (05C75)

Related Items (2)

Critical properties of bipartite permutation graphs ⋮ Hereditary classes of graphs: a parametric approach

Cites Work

• The structure of almost all graphs in a hereditary property
• Excluding induced subgraphs. II: Extremal graphs
• Clique-width and the speed of hereditary properties
• The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent
• On the size of hereditary classes of graphs
• The speed of hereditary properties of graphs
• Two forbidden induced subgraphs and well-quasi-ordering
• A jump to the Bell number for hereditary graph properties
• The Complexity of the Partial Order Dimension Problem
• K l+1 -Free Graphs: Asymptotic Structure and a 0-1 Law
• Excluding induced subgraphs: quadrilaterals
• Excluding Induced Subgraphs III: A General Asymptotic
• The penultimate rate of growth for graph properties
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Deciding the Bell Number for Hereditary Graph Properties