Excluding induced subgraphs III: a general asymptotic

HJ Prömel, A Steger - Random Structures & Algorithms, 1992 - Wiley Online Library
HJ Prömel, A Steger
Random Structures & Algorithms, 1992•Wiley Online Library
In this article we study asymptotic properties of the class of graphs not containing a fixed
graph H as an induced subgraph. In particular we show that the number Forb n★(H) of such
graphs on n vertices is essentially determined by the number of subgraphs of a single graph.
This implies that
Abstract
In this article we study asymptotic properties of the class of graphs not containing a fixed graph H as an induced subgraph. In particular we show that the number Forb n★(H) of such graphs on n vertices is essentially determined by the number of subgraphs of a single graph. This implies that
Wiley Online Library
Show moreShow less
Save Cite Cited by 136 Related articles All 2 versions Library Search