Premium
A generalization of the ray‐chaudhuri‐wilson theorem
Author(s) -
Snevily Hunter S.
Publication year - 1995
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.3180030505
Subject(s) - mathematics , combinatorics , conjecture , generalization , statement (logic) , set (abstract data type) , discrete mathematics , mathematical analysis , law , political science , computer science , programming language
Abstract Let K = { k 1 ,…, k r } and L = { l 1 ,…, l s } be two sets of non‐negative integers and assume k i > l j for every i,j. Let F be an L ‐intersecting family of subsets of a set of n elements. Assume the size of every set in F is a number from K. We conjecture that | F | ⩽ ( n s ). We prove that our conjecturer is true for any K. (with min k i ⩾ s ) when L = {0,1,…, s − 1}. We also show that for any K and any L , (with min k i > max l j ) CALLING STATEMENT : © 1995 John Wiley & Sons, Inc.