Fractional matching in hypergraphs
Combinatorics
2015-03-27 v2
Abstract
We find the exact formula for the minimal number of edges of hypergraph which guaranteed fractional matching of cardinality in the case when is integer.
Keywords
Cite
@article{arxiv.1311.2671,
title = {Fractional matching in hypergraphs},
author = {Vladimir Blinovsky},
journal= {arXiv preprint arXiv:1311.2671},
year = {2015}
}
Comments
Final version