(a,b)-Cut

[math]\displaystyle{ (a,b) }[/math]-Cut --- [math]\displaystyle{ (a,b) }[/math]-разрез.

Given a graph [math]\displaystyle{ G }[/math], [math]\displaystyle{ (a,b) }[/math]-C. is a set [math]\displaystyle{ F }[/math] of edges representing (covering) all [math]\displaystyle{ (a,b) }[/math]-paths.