Abstract
It is proved that one can choose disjoint pairs of k-element subsets of an n-element set in such a way that the unions of the pairs are all different, supposing that n > n(k).
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: AKCE International Journal of Graphs and Combinatorics
Paper Title
Journal
Date
