Просмотр кода страницы F-Width (of a hypergraph)

'''<math>F</math>-Width (of a hypergraph)''' --- <math>F</math>-ширина. 

Let <math>H</math> and <math>F</math> be     two hypergraphs on the same vertex set.
The ''' <math>F</math>-width''' <math>w(H,F)</math> of <math>H</math> is the minimal size of an ''<math>H</math>-covering set'' of edges from <math>F</math>. The '''<math>F</math>-matching width'''
<math>mw(H,F)</math> of <math>H</math> is the maximum, over all '' matchings'' <math>M</math> in <math>H</math>,
of <math>w(H,F)</math>. We write <math>w(H)</math> and <math>mw(H)</math> for <math>w(H,H)</math> and <math>mw(H,H)</math>,
respectively, and call these parameters the ''' width''' and '''matching width''' of <math>H</math>.

The ''' independent <math>F</math>-width''' <math>iw(H, F)</math> of <math>H</math> is the minimal size
of a covering matching in <math>F</math>. The ''' independent <math>F</math>-matching width''' <math>imv(H,F)</math> of <math>H</math> is the maximum, over all matchings <math>M</math> of
<math>H</math>, of <math>im(M,F)</math>. Again, we write <math>iw(H)</math> for <math>iw(H,H)</math> and
<math>imw(H,H)</math>, and call them the ''' independent width''' and '''independent matching width''' of <math>H</math>, respectively.