Subgraph-closed graph property
= Subgraph-closed graph property
= Monotone graph property in extremal enumeration
{synonym}
Membership is preserved under deleting <vertices> and <edges>. This is the decreasing meaning of monotonicity in extremal <graph> enumeration; it differs from an increasing <monotone graph property> used for random-graph thresholds. For a proper unbounded class, its least excluded chromatic number determines the leading quadratic logarithm of its labelled speed.