论文信息 - Interval Packing and Covering in the Boolean Lattice - 字舞流文

Interval Packing and Covering in the Boolean Lattice

Konrad Engel | K. Engel

[1] B. Bollobás. On generalized graphs , 1965 .

[2] E. Sperner. Ein Satz über Untermengen einer endlichen Menge , 1928 .

[3] A. Nilli. Perfect Hashing and Probability , 1994, Combinatorics, Probability and Computing.

[4] Konrad Engel,et al. The order-interval hypergraph of a finite poset and the König property , 1997, Discret. Math..

[5] Zsolt Tuza,et al. Inequalities for two set systems with prescribed intersections , 1987, Graphs Comb..

[6] Hans-Dietrich O. F. Gronau. Coverings of the complete (di-)graph with n vertices by complete bipartite (di-)graphs with n vertices I , 1981, Discret. Math..

[7] Konrad Engel,et al. Interval stability and interval covering property in finite posets , 1992 .

[8] David K. Arrowsmith,et al. Reciprocity and Polynomial Properties for Even Flows and Potentials on Directed Graphs , 1994, Combinatorics, Probability and Computing.

[9] László Lovász,et al. On the ratio of optimal integral and fractional covers , 1975, Discret. Math..

[10] Ingo Wegener,et al. A Remark on Minimal Polynomials of Boolean Functions , 1988, CSL.

[11] Attila Sali. Constructions of ranked posets , 1988, Discret. Math..