Defect n-extendable graph

Defect [math]\displaystyle{ n }[/math]-extendable graph --- дефектно [math]\displaystyle{ n }[/math]-расширяемый граф.

If [math]\displaystyle{ G }[/math] is a connected graph and any [math]\displaystyle{ n }[/math] independent edges in [math]\displaystyle{ G }[/math] are contained in a near perfect matching of [math]\displaystyle{ G }[/math] where [math]\displaystyle{ n \leq (|V(G)| - 2)/2 }[/math], then [math]\displaystyle{ G }[/math] is defect n-extendable.