Abstract
Fix two distinct parallel linese andf. A 2-interval is the union of an interval one and an interval onf. We study thetransversal number τ (ℋ) of families of 2-intervals ℋ. This is the cardinality of the smallest set which intersects every 2-interval in ℋ. A Gyárfás and J. Lehel [6] proved that τ(ℋ)=O(υ(ℋ)2) where ν(ℋ) is the maximum number of disjoint 2-intervals in ℋ. In the present paper we prove the tight bond τ(ℋ)≤2v(ℋ).
Our result has applications in the estimation of the transversal number of other types of set systems.
The method we use is topological. We associate a simplicial complexK with our system of 2-intervals and prove that a given subcomplex is contractible inK unless the required transversal exists. Then we construct a cocycle of (another subcomplex of)K to prove that the subcomplex is not contractible inK. We hope that this approach will be applicable to a wider variety of combinatorial optimization problems.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
P. Alexandroff, andH. Hopf: Topologie, Springer Verlag, 1935.
A. Björner: Topological methods, inHandbook of Combinatorics, ed. R. Graham, M. Grötschel, and L. Lovász.
A. Björner, B. Korte, andL. Lovász: Homotopy properties of greedoids,Advances in Appl. Math.,6 (1985), 447–494.
K. Borsuk: On the imbedding of compacta in simplicial complexes.Fundamenta Math.,35 (1948), 217–234.
S. Eilenberg, andN. Steenrod: Foundations of algebraic topology, Princeton University Press, 1952.
A. Gyárfás, andL. Lehel: A Helly-type theorem in trees, inCombinatorial Theory and its Applications, Balatonfüred (Hungary), Colloquia Mathematica Societatis János Bolyai4, 1969, pp. 571–584.
A. Hajnal, andJ. Surányi: Über die Auflösung von Graphen in vollständige Teilgraphen,Annales Univ. Sci. Budapest,1 (1958), 113–121.
Gy. Károlyi, andG. Tardos: On point covers of multiple intervals and axisparallel rectangles, manuscript, 1994
E. Spanier: Algebraic topology, McGraw-Hill, 1966
Author information
Authors and Affiliations
Additional information
Supported by the NSF grant No. CCR-92-00788 and the (Hungarian) National Scientific Research Fund (OTKA) grant No. T4271. The author was visiting the Computation and Automation Institute of the Hungarian Academy of Sciences while part of this research was done.