The speed of hereditary properties of graphs

DOI10.1006/jctb.2000.1952zbMath1026.05062MaRDI QIDQ1850473

Béla Bollobás, József Balogh, David Weinreich

Publication date: 10 December 2002

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jctb.2000.1952

Mathematics Subject Classification ID

05C35: Extremal problems in graph theory

05C80: Random graphs (graph-theoretic aspects)

05C99: Graph theory

Related Items

Between 2- and 3-colorability, The penultimate rate of growth for graph properties, Measures on monotone properties of graphs, Boundary properties of graphs for algorithmic graph problems, The structure of almost all graphs in a hereditary property, Hereditary properties of partitions, ordered graphs and ordered hypergraphs, The maximum edit distance from hereditary graph properties, Generating all maximal induced subgraphs for hereditary and connected-hereditary graph properties, Growth constants of minor-closed classes of graphs, The number of graphs without forbidden subgraphs, Shadows of ordered graphs, The unlabelled speed of a hereditary graph property, A jump to the Bell number for hereditary graph properties, Excluding induced subgraphs: Critical graphs, Definability of Combinatorial Functions and Their Linear Recurrence Relations

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Excluding induced subgraphs. II: Extremal graphs
• 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
• Excluding induced subgraphs: quadrilaterals
• Excluding Induced Subgraphs III: A General Asymptotic
• On the entropy values of hereditary classes of graphs
• On the Structure of Edge Graphs
• Generalized chromatic numbers of random graphs
• Projections of Bodies and Hereditary Properties of Hypergraphs