Claims

../

1965_01_01_erdos: Erdős's 1965 statement that the lcm-triple conjecture is proved, resting on his reduction to union-free families and on the unpublished bound of Sárközy and Szemerédi that such families have o(2^n) members; superseded by Kleitman.

1971_01_01_kleitman: Kleitman's 1971 theorem that a union-free family of subsets of an n-set has at most (1+o(1)) times the middle binomial coefficient members; by Erdős's reduction it settles the lcm-triple question, and the site credits it.

---