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 propertieshereditary propertiesforbidden subgraphsmonotone properties

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Asymptotic enumeration (05A16) Ramsey theory (05D10) Inequalities and extremum problems in real or complex geometry (51M16)

Related Items (18)

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

This page was built for publication: Hereditary properties of graphs: Asymptotic enumeration, global structure, and colouring