Transversals of \(d\)-intervals

DOI10.1007/PL00009315zbMath0883.05124OpenAlexW1971007914MaRDI QIDQ1364141

Tomáš Kaiser

Publication date: 23 February 1998

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/pl00009315

zbMATH Keywords

intervalsmatching numberpacking numbertransversaltransversal numbermultiple intervalstheorem of Gallai

Mathematics Subject Classification ID

Transversal (matching) theory (05D15) Combinatorial aspects of packing and covering (05B40)

Related Items (14)

Identifying Codes in Hereditary Classes of Graphs and VC-Dimension ⋮ Red-blue clique partitions and \((1-1)\)-transversals ⋮ Recent techniques and results on the Erdős-Pósa property ⋮ Edge-covers in \(d\)-interval hypergraphs ⋮ Bounds on piercing and line-piercing numbers in families of convex sets in the plane ⋮ A sparse colorful polytopal KKM theorem ⋮ Using Brouwer’s Fixed Point Theorem ⋮ Piercing translates and homothets of a convex body ⋮ The \((p, q)\) property in families of \(d\)-intervals and \(d\)-trees ⋮ Fractional covers and matchings in families of weighted \(d\)-intervals ⋮ Intersection reverse sequences and geometric applications. ⋮ A bijection between the \(d\)-dimensional simplices with distances in \(\{1,2\}\) and the partitions of \(d+1\) ⋮ Piercing numbers in approval voting ⋮ The maximum clique problem in multiple interval graphs

This page was built for publication: Transversals of \(d\)-intervals