An extension of balance notion from the theory of signed graphs to the case of finite sets systems is presented. For a finite set T , a subset S ⊆ T and a family F of subsets of T we denote by δm (S|F) respectively δM (S|F) the minimum/maximum number of changes (addition or deletion of elements), without repetition, which trans- forms S into a set from F.
['Dragos Radu Popescu']
Balance in Systems of Finite Sets with Applications.