Name
Abstract | ||
|---|---|---|
Let n and q be given integers and X a nite set with n elements. The following theorem is proved for n>n 0(q). The family of all q-element subsets of X can be partitioned into disjoint pairs (except possibly one if n q is odd), so that jA1\A2j+ jB1 \ B2 jq, jA1 \ B2j + jB1 \ A2 jq holds for any two such pairs fA1;B1g and fA2;B2g. This is a sharpening of a theorem in (2). It is also shown that this is a coding type problem, and several problems of similar nature are posed. |
Year | Venue | DocType |
|---|---|---|
2001 | Electr. J. Comb. | Journal |
Volume | Issue | Citations |
8 | 2 | 2 |
PageRank | References | Authors |
0.37 | 0 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Hikoe Enomoto | 1 | 390 | 67.58 |
| Gyula O. H. Katona | 2 | 264 | 66.44 |