A jump to the Bell number for hereditary graph properties
From MaRDI portal
Publication:2565685
DOI10.1016/j.jctb.2005.02.004zbMath1070.05052MaRDI QIDQ2565685
Béla Bollobás, József Balogh, David Weinreich
Publication date: 28 September 2005
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jctb.2005.02.004
05C35: Extremal problems in graph theory
05C78: Graph labelling (graceful graphs, bandwidth, etc.)
05C55: Generalized Ramsey theory
Related Items
Word-Representable Graphs: a Survey, 𝑉𝐶_{ℓ}-dimension and the jump to the fastest speed of a hereditary ℒ-property, The structure and the number of \(P_7\)-free bipartite graphs, The structure and the number of \(P_7\)-free bipartite graphs, Deciding the Bell Number for Hereditary Graph Properties, A jump to the Narayana number for hereditary properties of ordered 3-uniform hypergraphs, Locally bounded coverings and factorial properties of graphs, The structure of almost all graphs in a hereditary property, Hereditary properties of partitions, ordered graphs and ordered hypergraphs, Minimum difference representations of graphs, Growth constants of minor-closed classes of graphs, Hereditary classes of graphs: a parametric approach, On the speed of algebraically defined graph classes, Asymptotics of pattern avoidance in the Klazar set partition and permutation-tuple settings, Shadows of ordered graphs, The unlabelled speed of a hereditary graph property, Jumps in speeds of hereditary properties in finite relational languages, Classes of graphs without star forests and related graphs
Cites Work
