On a Combinatorial Problem of Erdos

DOI10.2307/2035075MaRDI QIDQ5513776zbMATH OpenOpenAlexFDO

Authors Daniel J. Kleitman

Publication date 1966

Published in Proceedings of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2307/2035075

zbMATH Keywords

combinatorics

Cited in

(6)

• Partitioning a power set into union-free classes
• On the solvability of the equations \([a_i,a_j] = a_r\) and \((a'_i,a'_j) = a'_r\) in sequences of positive density
• Maximum union-free subfamilies
• The entropy rounding method in approximation algorithms
• Extremal families containing no two sets and their union
• Some generalized type functional dependencies formalized as equality set on matrices

This page was built for publication: On a Combinatorial Problem of Erdos

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5513776)