Fractional matching in hypergraphs

26 Mar 2015  ·  Blinovsky Vladimir ·

We find the exact formula for the minimal number of edges of hypergraph which guaranteed fractional matching of cardinality $s$ in the case when $sn$ is integer.

PDF Abstract
No code implementations yet. Submit your code now

Categories


Combinatorics