Hereditary properties of graphs: Asymptotic enumeration, global structure, and colouring (Q1126826): Difference between revisions
From MaRDI portal
Created a new Item |
Set profile property. |
||
(3 intermediate revisions by 2 users not shown) | |||
Property / reviewed by | |||
Property / reviewed by: Peter Brass / rank | |||
Property / reviewed by | |||
Property / reviewed by: Peter Brass / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 03:17, 5 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Hereditary properties of graphs: Asymptotic enumeration, global structure, and colouring |
scientific article |
Statements
Hereditary properties of graphs: Asymptotic enumeration, global structure, and colouring (English)
0 references
5 August 1998
0 references
A hereditary graph property \(\mathcal P\) is a class of graphs that contains infinitely many graphs and is closed under taking induced subgraphs. This paper gives a survey of results on hereditary properties \({\mathcal P}\), especially on the growth rate of the number of graphs of order \(n\) in \({\mathcal P}\) (size of \({\mathcal P}\)), on the structure of \({\mathcal P}\) in terms of forbidden subgraphs, and on the behaviour of the \({\mathcal P}\)-chromatic number (where each color class is required to be a graph of \({\mathcal P}\)).
0 references
graph properties
0 references
hereditary properties
0 references
monotone properties
0 references
forbidden subgraphs
0 references