Fractional matching in hypergraphs

Abstract

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.

Final version

References in corpus (1)

• Minimal Number of Edges in Hypergraph Guaranteeing Perfect Fractional Matching and MMS Conjecture

Cited by in corpus (2)

• Comments to Symmetrical Smoothing Method and First Step to How to Avoid Irrelevant Extremums
• Erdös's Matching Conjecture and $s$-wise $t$-intersection Conjecture via Symmetrical Smoothing Method