H-Saturated graph

[math]\displaystyle{ H }[/math]-Saturated graph --- [math]\displaystyle{ H }[/math]-насыщенный граф.

A graph [math]\displaystyle{ G }[/math] is [math]\displaystyle{ H }[/math]-saturated, if [math]\displaystyle{ G }[/math] is [math]\displaystyle{ H }[/math]-free and adding any new edge [math]\displaystyle{ e }[/math] to [math]\displaystyle{ G }[/math] creates a copy of [math]\displaystyle{ H }[/math].