论文信息 - On point covers of multiple intervals and axis-parallel rectangles

On point covers of multiple intervals and axis-parallel rectangles

In certain families of hypergraphs the transversal number is bounded by some function of the packing number. In this paper we study hypergraphs related to multiple intervals and axisparallel rectangles, respectively. Essential improvements of former established upper bounds are presented here. We explore the close connection between the two problems at issue.

Gábor Tardos | Gyula Károlyi

[1] Gábor Tardos. Transversals of 2-intervals, a topological approach , 1995, Comb..

[2] Gy. K árolyi. On point covers of parallel rectangles , 1991 .

[3] Paul Seymour,et al. Bounding the vertex cover number of a hypergraph , 1994, Comb..

[4] András Gyárfás,et al. Covering and coloring problems for relatives of intervals , 1985, Discret. Math..

[5] János Pach,et al. Some geometric applications of Dilworth’s theorem , 1994, Discret. Comput. Geom..

[6] G. Wegner,et al. Über eine kombinatorisch-geometrische Frage von Hadwiger und Debrunner , 1965 .

[7] János Pach,et al. Some geometric applications of Dilworth's theorem , 1993, SCG '93.

[8] Alexandr V. Kostochka,et al. Covering boxes by points , 1993, Discret. Math..