---
res:
bibo_abstract:
- Let I(n, t) be the class of all t-intersecting families of subsets of [n] and
set I-k(n, t) = I(n, t) boolean AND 2(([n])(k)), I-less than or equal tok(n, t)
= I(n, t) boolean AND 2(([n])(less than or equal tok)). After the maximal families
in I(n, t) [13] and in I-k(n, t) [1, 9] are known we study now maximal families
in I-less than or equal tok(n, t). We present a conjecture about the maximal cardinalities
and prove it in several cases. More generally cardinalities are replaced by weights
and asymptotic estimates are given. Analogous investigations are made for I(n,
t) boolean AND C(n, s), where C(n, s) is the class of all s-cointersecting families
of subsets of [n]. In particular we establish an asymptotic form of a conjecture
by Bang et al. [4]. (C) 2002 Elsevier Science Ltd. All rights reserved.@eng
bibo_authorlist:
- foaf_Person:
foaf_givenName: Rudolf
foaf_name: Ahlswede, Rudolf
foaf_surname: Ahlswede
foaf_workInfoHomepage: http://www.librecat.org/personId=10479
- foaf_Person:
foaf_givenName: C
foaf_name: Bey, C
foaf_surname: Bey
- foaf_Person:
foaf_givenName: K
foaf_name: Engel, K
foaf_surname: Engel
- foaf_Person:
foaf_givenName: Levon H.
foaf_name: Khachatrian, Levon H.
foaf_surname: Khachatrian
bibo_doi: 10.1006/eujc.2002.0590
bibo_issue: '5'
bibo_volume: 23
dct_date: 2002^xs_gYear
dct_identifier:
- UT:000178540300001
dct_isPartOf:
- http://id.crossref.org/issn/0195-6698
dct_language: eng
dct_publisher: ACADEMIC PRESS LTD ELSEVIER SCIENCE LTD@
dct_title: The t-intersection problem in the truncated boolean lattice@
...