Partitioning a power set into union-free classes

DOI10.1016/0012-365X(91)90002-JzbMath0790.05010MaRDI QIDQ1176718

Martin Aigner, Dwight Duffus, Daniel J. Kleitman

Publication date: 25 June 1992

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

boundsminimum coloringspartitioning a power setunion-free colorings

Mathematics Subject Classification ID

Partitions of sets (05A18)

Related Items

Maximum union-free subfamilies, Extremal problems for sets forming Boolean algebras and complete partite hypergraphs

Cites Work

• Unnamed Item
• Hook-free colorings and a problem of Hanson
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• On a Combinatorial Problem of Erdos
• A problem of Schur and its generalizations