Deficiency

Deficiency --- дефицит.

The deficiency $def({\mathcal A})$ of a family ${\mathcal A}$ of hypergraphs is the minimal natural number $d$ such that the matching width $mw({\mathcal B})$ satisfies the condition

$mw(\cup{\mathcal B}) \geq |{\mathcal B}| - d$

for every subfamily ${\mathcal B}$ of ${\mathcal A}$.