Long Symmetric Chains in the Boolean Lattice
暂无分享,去创建一个
[1] Daniel J. Kleitman,et al. Minimum cutsets for an element of a boolean lattice , 1989 .
[2] Daniel J. Kleitman. On a problem of Yuzvinsky on separating the n-cube , 1986, Discret. Math..
[3] Zoltán Füredi,et al. A minimal cutset of the boolean lattice with almost all members , 1989, Graphs Comb..
[4] Charles J. Colbourn,et al. The Combinatorics of Network Reliability , 1987 .
[5] Jerrold R. Griggs. Matchings, cutsets, and chain partitions in graded posets , 1995, Discret. Math..
[6] Ron Holzman,et al. Packing lines in a hypercube , 1993, Discret. Math..
[7] William Y. C. Chen,et al. Derangements on the n-cube , 1993, Discret. Math..
[8] Richard J. Nowakowski. Cutsets of Boolean lattices , 1987, Discret. Math..
[9] Hunter S. Snevily. Combinatorics of finite sets , 1991 .
[10] Feng Shi,et al. The density of a maximum minimal cut in the subset lattice of a finite set is almost one , 1993, Discret. Math..
[11] Jerry L. Trahan,et al. Improved Lower Bounds on the Reliability of Hypercube Architectures , 1994, IEEE Trans. Parallel Distributed Syst..