A jump to the Bell number for hereditary graph properties

DOI10.1016/J.JCTB.2005.02.004MaRDI QIDQ2565685zbMATH OpenOpenAlexFDO

Authors József Balogh, Béla Bollobás, 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

zbMATH Keywords

sizecharacterizationposetspeedDilworth theoremRamsey

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Generalized Ramsey theory (05C55) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Recommendations

• Deciding the Bell number for hereditary graph properties
• Deciding the Bell number for hereditary graph properties
• On the jump number problem in hereditary classes of bipartite graphs
• A survey of hereditary properties of graphs
• On hereditary Helly classes of graphs
• The structure of almost all graphs in a hereditary property
• Some extremal problems for hereditary properties of graphs
• Hereditary properties of graphs: Asymptotic enumeration, global structure, and colouring
• On invariants of hereditary graph properties
• Hereditary properties of graphs

Cites work

• scientific article; zbMATH DE number 3285073 (Why is no real title available?)
• scientific article; zbMATH DE number 970795 (Why is no real title available?)
• Hypergraphs do not jump
• Measures on monotone properties of graphs
• On a problem of K. Zarankiewicz
• On the size of hereditary classes of graphs
• On the structure of linear graphs
• The penultimate rate of growth for graph properties
• The speed of hereditary properties of graphs

Cited in

(24)

• Asymptotics of pattern avoidance in the Klazar set partition and permutation-tuple settings
• Locally bounded coverings and factorial properties of graphs
• Minimum difference representations of graphs
• The unlabelled speed of a hereditary graph property
• On the jump number problem in hereditary classes of bipartite graphs
• Jumps in speeds of hereditary properties in finite relational languages
• Classes of graphs without star forests and related graphs
• Critical properties of bipartite permutation graphs
• Hereditary classes of graphs: a parametric approach
• The structure of almost all graphs in a hereditary property
• Growth constants of minor-closed classes of graphs
• On the speed of algebraically defined graph classes
• The penultimate rate of growth for graph properties
• Shadows of ordered graphs
• The structure and the number of \(P_7\)-free bipartite graphs
• The structure and the number of \(P_7\)-free bipartite graphs
• A jump to the Narayana number for hereditary properties of ordered 3-uniform hypergraphs
• Word-Representable Graphs: a Survey
• Randomized communication and implicit graph representations
• \(\mathrm{VC}_{\ell }\)-dimension and the jump to the fastest speed of a hereditary \(\mathcal {L}\)-property
• Deciding the Bell number for hereditary graph properties
• Deciding the Bell number for hereditary graph properties
• Hereditary properties of partitions, ordered graphs and ordered hypergraphs
• Consistent random vertex-orderings of graphs

This page was built for publication: A jump to the Bell number for hereditary graph properties

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2565685)