Fractional covers and matchings in families of weighted d-intervals

DOI10.1007/S00493-016-3174-7MaRDI QIDQ681591zbMATH OpenOpenAlexFDO

Authors Ron Aharoni, Tomáš Kaiser, Shira Zerbib

Publication date 12 February 2018

Published in Combinatorica (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1402.2064

zbMATH Keywords

fractional coversmatchingsweighted intervals

Mathematics Subject Classification ID

Fractional graph theory, fuzzy graph theory (05C72) Transversal (matching) theory (05D15)

Abstract: A $d$-{em interval} is a union of at most $d$ disjoint closed intervals on a fixed line. Tardos [Combinatorica 15 (1995), 123-134] and the second author [Disc. Comput. Geom. 18 (1997), 195-203] used topological tools to bound the transversal number $au$ of a family $H$ of $d$-intervals in terms of $d$ and the matching number $u$ of $H$. We investigate the weighted and fractional versions of this problem and prove upper bounds that are tight up to constant factors. We apply both the topological method and an approach of Alon [Disc. Comput. Geom. 19 (1998), 333-334]. For the use of the latter, we prove a weighted version of Tur'{a}n's theorem. We also provide a proof of the second author's upper bound that is more direct than the original proof.

Review text

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.

Recommendations

• Edge-covers in \(d\)-interval hypergraphs
• Fractional v. integral covers in hypergraphs of bounded edge size
• LP duality in infinite hypergraphs
• scientific article; zbMATH DE number 1195536
• Solution of two fractional packing problems of Lovász. (Reprint)

Cites work

• A simple proof of K-K-M-S theorem
• Covering a hypergraph of subgraphs
• Covering and coloring problems for relatives of intervals
• scientific article; zbMATH DE number 1195536 (Why is no real title available?)
• scientific article; zbMATH DE number 3214398 (Why is no real title available?)
• scientific article; zbMATH DE number 3353324 (Why is no real title available?)
• scientific article; zbMATH DE number 3422228 (Why is no real title available?)
• KKM -- a topological approach for trees
• Lower bounds on the transversal numbers of \(d\)-intervals
• On the chromatic number of multiple interval graphs and overlap graphs
• Piercing d-intervals
• Transversals of 2-intervals, a topological approach
• Transversals of d-intervals

Cited in

(4)

• Edge-covers in \(d\)-interval hypergraphs
• A Sharp Bound on the Ratio Between Optimal Integer and Fractional Covers
• A sparse colorful polytopal KKM theorem
• Fractionally balanced hypergraphs and rainbow KKM theorems

This page was built for publication: Fractional covers and matchings in families of weighted \(d\)-intervals

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q681591)