TY - GEN
T1 - Disjoint systems
AU - Alon, Noga
AU - Sudakov, Benny
N1 - Publisher Copyright:
© 1994, Springer Verlag. All rights reserved.
PY - 1994
Y1 - 1994
N2 - A disjoint system of type (∀, ∃, k, n) is a collection C={A1, …, Am} of pairwise disjoint families of k-subsets of an n-element set satisfying the following condition. For every ordered pair Ai and Aj of distinct members of C and for every A ∈ Ai there exists a B ∈ Aj that does not intersect A. Let Dn(∀, ∃, k) denote the maximum possible cardinality of a disjoint system of type (∀, ∃, k, n). It is shown that for every fixed k≥2, (Formula Presented) This settles a problem of Ahlswede, Cai and Zhang. Several related problems are considered as well.
AB - A disjoint system of type (∀, ∃, k, n) is a collection C={A1, …, Am} of pairwise disjoint families of k-subsets of an n-element set satisfying the following condition. For every ordered pair Ai and Aj of distinct members of C and for every A ∈ Ai there exists a B ∈ Aj that does not intersect A. Let Dn(∀, ∃, k) denote the maximum possible cardinality of a disjoint system of type (∀, ∃, k, n). It is shown that for every fixed k≥2, (Formula Presented) This settles a problem of Ahlswede, Cai and Zhang. Several related problems are considered as well.
UR - http://www.scopus.com/inward/record.url?scp=85026852518&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85026852518&partnerID=8YFLogxK
U2 - 10.1007/3-540-57843-9_17
DO - 10.1007/3-540-57843-9_17
M3 - Conference contribution
AN - SCOPUS:85026852518
SN - 9783540578437
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 159
EP - 163
BT - Algebraic Coding - 1st French-Israeli Workshop, Proceedings
A2 - Cohen, Gerard
A2 - Lobstein, Antoine
A2 - Zemor, Gilles
A2 - Litsyn, Simon
PB - Springer Verlag
T2 - 1st French-Israeli Workshop on Algebraic Coding, 1993
Y2 - 19 July 1993 through 21 July 1993
ER -