Covering a hypergraph of subgraphs

Discrete Mathematics

Volumn 257, Issue 2-3, 2002, Pages 249-254

  Alon, Noga ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 31244435891     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(02)00427-2     Document Type: Article

References (10)

1. N. Alon, Piercing d-intervals, Discrete Comput. Geom. 19 (1998) 333-334.
2. N. Alon, G. Kalai, Bounding the piercing number, Discrete Comput. Geom. 13 (1995) 245-256.
3. N. Alon, D.J. Kleitman, Piercing convex sets and the Hadwiger Debrunner (p,q)-problem, Adv. Math. 96 (1992) 103-112.
4. A. Gyárfás, J. Lehel, A Helly-type problem in trees, in: P. Erdos, A. Rényi, V.T. Sós (Eds.), Combinatorial Theory and its Applications, North-Holland, Amsterdam, 1970, pp. 571-584.
5. T. Kaiser, Transversals of d-intervals, Discrete Comput. Geom. 18 (1997) 195-203.
6. J. Matoušek, Lower bounds on the transversal numbers of d-intervals, Discrete Comput. Geom. 26 (2001) 283-287.
7. N. Robertson, P. Seymour, Graph minors. II. Algorithmic aspects of tree-width, J. Algorithms 7 (1986) 309-322.
8. N. Robertson, P. Seymour, R. Thomas, Quickly excluding a planar graph, J. Combin. Theory Ser. B 62 (1994) 323-348.
9. G. Tardos, Transversals of 2-intervals, a topological approach, Combinatorica 15 (1995) 123-134.
10. G. Tardos, Transversals of d-intervals - comparing three approaches, European Congress of Mathematics, Vol. II, Progress in Mathematics, No. 169 (Budapest, 1996), Birkhauser, Basel, 1998, pp. 234-243.