Hereditary properties of graphs: Asymptotic enumeration, global structure, and colouring

zbMath0902.05028MaRDI QIDQ1126826

Béla Bollobás

Publication date: 5 August 1998

Published in: Documenta Mathematica (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/224709

zbMATH Keywords

graph properties; hereditary properties; forbidden subgraphs; monotone properties

Mathematics Subject Classification ID

05C15: Coloring of graphs and hypergraphs

05A16: Asymptotic enumeration

05D10: Ramsey theory

51M16: Inequalities and extremum problems in real or complex geometry

Related Items

Estimating parameters associated with monotone properties, Hereditary properties of combinatorial structures: Posets and oriented graphs, Complexity of equilibrium in competitive diffusion games on social networks, Phase transition for the threshold contact process, an approximation of heterogeneous random Boolean networks, Hereditary properties of partitions, ordered graphs and ordered hypergraphs, On hypergraphs without loose cycles, False positive and false negative effects on network attacks, Graph 2-rankings, Some relational structures with polynomial growth and their associated algebras. I: Quasi-polynomiality of the profile, Linear arboricity of regular digraphs, The dual graph shift operator: identifying the support of the frequency domain, Homological connectivity in random Čech complexes, Limits of random trees. II, Shadows of ordered graphs, The orbit algebra of an oligomorphic permutation group with polynomial profile is Cohen-Macaulay, On the problem of domino recognition, On the Diameter of Hyperbolic Random Graphs, On the editing distance of graphs