Sciweavers

CORR
2010
Springer
44views Education» more  CORR 2010»
13 years 9 months ago
Maximum union-free subfamilies
An old problem of Moser asks: how large of a union-free subfamily does every family of m sets have? A family of sets is called union-free if there are no three distinct sets in th...
Jacob Fox, Choongbum Lee, Benny Sudakov
COMBINATORICS
1998
91views more  COMBINATORICS 1998»
14 years 4 days ago
New Bounds for Union-free Families of Sets
: Following Frankl and F¨uredi [1] we say a family, F, of subsets of an n-set is weakly union-free if F does not contain four distinct sets A, B, C, D with A ∪ B = C ∪ D. If i...
Don Coppersmith, James B. Shearer