Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Fractional matchings in hypergraphs

Fractional matchings in hypergraphs We find an exact formula for the minimum number of edges in a hypergraph which guarantees a fractional matching of cardinality s in the case where sn is an integer. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Problems of Information Transmission Springer Journals

Fractional matchings in hypergraphs

Problems of Information Transmission , Volume 51 (1) – Apr 16, 2015

Loading next page...
 
/lp/springer_journal/fractional-matchings-in-hypergraphs-x7C7BKvex4

References (4)

Publisher
Springer Journals
Copyright
Copyright © 2015 by Pleiades Publishing, Inc.
Subject
Engineering; Communications Engineering, Networks; Electrical Engineering; Information Storage and Retrieval; Systems Theory, Control
ISSN
0032-9460
eISSN
1608-3253
DOI
10.1134/S0032946015010032
Publisher site
See Article on Publisher Site

Abstract

We find an exact formula for the minimum number of edges in a hypergraph which guarantees a fractional matching of cardinality s in the case where sn is an integer.

Journal

Problems of Information TransmissionSpringer Journals

Published: Apr 16, 2015

There are no references for this article.