Interval packing and covering in the boolean lattice

Combinatorics Probability and Computing

Volumn 5, Issue 4, 1996, Pages 373-384

  Engel, Konrad ^a  

^a UNIVERSITY OF ROSTOCK   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0030362831     PISSN: 09635483     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0963548300002121     Document Type: Article

References (14)

1. Bollobás, B. (1965) On generalized graphs. Acta Math. Acad. Sci. Hungar. 16 447-452.
2. Bouchemakh, I. and Engel, K. (1992) Interval stability and interval covering property in finite posets. Order 9 163-175.
3. Bouchemakh, I. and Engel, K. (1994) The order-interval hypergraph of a finite poset and the König property. Discrete Math, (to appear).
4. Gronau, H.-D. O. F. (1981) Coverings of the complete (di-)graph with n vertices by complete bipartite (di-)graphs with n vertices I. Discrete Math. 37 67-72.
5. Kleitman, D. J. (1981) Methods for asymptotic counting. Congressus Numerantium 32 63-85.
6. Lovász, L. (1975) On the ratio of optimal integral and fractional covers. Discrete Math. 13 383-390.
7. Lovász, L. (1977) Flats in matroids and geometric graphs. In: Cameron, P. J. (Ed.), Combinatorial surveys, Proc. 6th British Comb. Conf., Egham 1977, Academic Press, London, 45-86.
8. Nilli, A. (1994) Perfect hashing and probability. Combinatorics, Probability and Computing 3 1-3.
9. Sali, A. (1988) Constructions of ranked posets. Discrete Math. 70 77-83.
10. Sperner, E. (1928) Ein Satz über Untermengen einer endlichen Menge. Math. Z. 27 544-548.
11. Tuza, Z. (1987) Inequalities for two set systems with prescribed intersections. Graphs and Combinatorics 3 75-80.
12. Tuza, Z. (1994) Applications of the set-pair method in extremal hypergraph theory. Bolyai Society Mathematical Studies 3 479-514.
13. Voigt, B. and Wegener, I. (1988) A remark on minimal polynomials of Boolean functions. In: CSL '88, Proc. 2nd Workshop: Lecture Notes in Computer Science 385, Duisburg, Germany, 372-383.
14. Warnke, I. (1994) Personal communication.