On a theorem of Lovász on covers in r-partite hypergraphs

Combinatorica

Volumn 16, Issue 2, 1996, Pages 149-174

  Aharoni, Ron ^a   Holzman, Ron ^a   Krivelevich, Michael ^b  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0040521674     PISSN: 02099683     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF01844843     Document Type: Article

References (7)

1. Z. FÜREDI: Matchings and covers in hypergraphs, Graphs and Combinatorics, 4 (1988), 115-206.
2. M. KRIVELEVICH: Approximate set covering in uniform hypergraphs, preprint.
3. L. LOVÁSZ: On the ratio of optimal integral and fractional covers, Discrete Math., 13 (1975), 383-390.
4. L. LOVÁSZ: On minimax theorems of combinatorics, Doctoral Thesis, Mathematikai Lapok, 26 (1975), 209-264. (in Hungarian)
5. L. LOVÁSZ: Covers, packings and some heuristic algorithms, in: 5th British Comb. Conf., Congressus Numerantium 15 Utilitas Math., Winnipeg, 1976, 417-429.
6. A. A. SAPOZHENKO: On the complexity of disjunctive normal forms obtained by greedy algorithm, Discret. Analyz, 21 (1972), 62-71. (in Russian)
7. S. K. STEIN: Two combinatorial covering theorems, J. Comb. Theory(A), 16 (1974), 391-397.