Просмотр кода страницы Edge cut, edge cut set

'''Edge cut, edge cut set''' --- разрез. 

A set <math>X</math> of edges of a graph <math>G</math> is called an '''edge cut''' if <math>G \setminus X</math> has more connected components than <math>G</math>. An '''edge cut''' of <math>G</math> minimal
under inclusion is called a '''cocircuit''' of <math>G</math>.
A '''vertex star''', which is the set of edges in
<math>G</math> incident to that vertex, is associated with
each vertex in <math>G</math>.