Fractional covers and matchings in families of weighted \(d\)-intervals (Q681591)

A classical result of Galai states that for a hypergraph \(H\) whose edges are closed intervals of \(R\), \(\nu(H)\) (the maximal size of a matching) equals \(\tau(H)\), (the minimum size of a cover). Relations of these two variants and their fractional analogies have been studied for \(d\)-hypergraphs whose edges are the union of at most \(d\) closed disjoint intervals. In this paper the weighted version is considered, and tight upper bounds for \(d\)-hypergraphs for the two invariants are presented. As a tool to obtain their bounds the authors prove a weighted version on Turán theorem that is of interest on its own right.