Fractional matchings in hypergraphs

DOI10.1134/S0032946015010032zbMath1317.05145OpenAlexW2029818494WikidataQ101496412 ScholiaQ101496412MaRDI QIDQ2355661

Vladimir Blinovsky

Publication date: 24 July 2015

Published in: Problems of Information Transmission (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0032946015010032

zbMATH Keywords

perfect fractional matching

Mathematics Subject Classification ID

Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• Large matchings in uniform hypergraphs and the conjectures of Erdős and samuels
• Cone dependence -- a basic combinatorial concept
• Minimum number of edges in a hypergraph guaranteeing a perfect fractional matching and the MMS conjecture

This page was built for publication: Fractional matchings in hypergraphs