Partitioning a power set into union-free
โ
Martin Aigner; Dwight Duffus; Daniel J. Kleitman
๐
Article
๐
1991
๐
Elsevier Science
๐
English
โ 353 KB
Aigner, M., D. Duffus and D.J. Kleitman, Partitioning a power set into union-free classes, Discrete Mathematics 88 (1991) 113-119. Two problems involving union-free colorings of the set of all subsets of an n-set are considered, with bounds obtained for minimum colorings. ## any integer n let g(n)