论文信息 - Partitioning Boolean lattices into chains of subsets - 字舞流文

Partitioning Boolean lattices into chains of subsets

We prove that the Boolean lattice of all subsets of an n-set can be partitioned into chains of size four if and only if n≥9.

Jerrold R. Griggs | Charles M. Grinstead | Roger K. C. Yeh

[1] L. Lovász. Combinatorial problems and exercises , 1979 .

[2] Jerrold R. Griggs. Problems on chain partitions , 1988, Discret. Math..

[3] P. Hall. On Representatives of Subsets , 1935 .

[4] de Ng Dick Bruijn,et al. On the set of divisors of a number , 1951 .

[5] Peter Frankl,et al. A new short proof for the Kruskal-Katona theorem , 1984, Discret. Math..