A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
Rainbow fractional matchings
[article]
2019
arXiv
pre-print
We prove that any family E_1, ... , E_ rn of (not necessarily distinct) sets of edges in an r-uniform hypergraph, each having a fractional matching of size n, has a rainbow fractional matching of size n (that is, a set of edges from distinct E_i's which supports such a fractional matching). When the hypergraph is r-partite and n is an integer, the number of sets needed goes down from rn to rn-r+1. The problem solved here is a fractional version of the corresponding problem about rainbow
arXiv:1805.09732v2
fatcat:lezlsdhkljhafl2d7sg3tvxbku