Counting \(H\)-free graphs
From MaRDI portal
Publication:1918567
DOI10.1016/0012-365X(94)00334-FzbMath0851.05057WikidataQ105583561 ScholiaQ105583561MaRDI QIDQ1918567
Angelika Steger, Hans Jürgen Prömel
Publication date: 18 July 1996
Published in: Discrete Mathematics (Search for Journal in Brave)
Related Items
Hereditary properties of partitions, ordered graphs and ordered hypergraphs, Almost all graphs with high girth and suitable density have high chromatic number, The Probability of Non-Existence of a Subgraph in a Moderately Sparse Random Graph
Cites Work