Premium
Partitions with certain intersection properties
Author(s) -
Gergely Péter M.
Publication year - 2011
Publication title -
journal of combinatorial designs
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.618
H-Index - 34
eISSN - 1520-6610
pISSN - 1063-8539
DOI - 10.1002/jcd.20290
Subject(s) - combinatorics , mathematics , intersection (aeronautics) , upper and lower bounds , constructive , class (philosophy) , set (abstract data type) , discrete mathematics , mathematical analysis , process (computing) , artificial intelligence , computer science , engineering , programming language , aerospace engineering , operating system
Partitions of the n ‐element set are considered. A family of m such partitions is called an ( n, m, k )‐pamily, if there are two classes for any pair of partitions whose intersection has at least k elements, and any pair of elements is in the same class for at most two partitions. Let f ( n, k ) denote the maximum of m for which an ( n, m, k )‐pamily exist. A constructive lower bound is given for f ( n, k ), which is compared with the trivial upper bound. Copyright © 2011 Wiley Periodicals, Inc. J Combin Designs 19:345‐354, 2011