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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.