Fractional covers and matchings in families of weighted d-intervals

DOI10.1007/S00493-016-3174-7zbMATH Open1399.05223arXiv1402.2064OpenAlexW1515839276MaRDI QIDQ681591FDOQ681591

Authors: Ron Aharoni, Tomáš Kaiser, Shira Zerbib 

Publication date: 12 February 2018

Published in: Combinatorica (Search for Journal in Brave)

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.

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

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)

zbMATH Keywords

matchingsfractional coversweighted intervals

Mathematics Subject Classification ID

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

Cites Work

• A simple proof of K-K-M-S theorem
• Title not available (Why is that?)
• Title not available (Why is that?)
• Transversals of \(d\)-intervals
• Piercing \(d\)-intervals
• Transversals of 2-intervals, a topological approach
• Covering a hypergraph of subgraphs
• KKM -- a topological approach for trees
• Lower bounds on the transversal numbers of \(d\)-intervals
• Covering and coloring problems for relatives of intervals
• On the chromatic number of multiple interval graphs and overlap graphs
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (3)

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

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)