The \(t\)-intersection problem in the truncated Boolean lattice (Q1864563): Difference between revisions

From MaRDI portal
ReferenceBot (talk | contribs)
Changed an Item
Import241208061232 (talk | contribs)
Normalize DOI.
 
(One intermediate revision by the same user not shown)
Property / DOI
 
Property / DOI: 10.1006/eujc.2002.0590 / rank
Normal rank
 
Property / DOI
 
Property / DOI: 10.1006/EUJC.2002.0590 / rank
 
Normal rank

Latest revision as of 10:43, 16 December 2024

scientific article
Language Label Description Also known as
English
The \(t\)-intersection problem in the truncated Boolean lattice
scientific article

    Statements

    The \(t\)-intersection problem in the truncated Boolean lattice (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    18 March 2003
    0 references
    This paper is a logical continuation of earlier important works of Ahlswede and Khachatrian. The authors deal with \(t\)-intersecting and/or \(s\)-co-intersecting families of restricted sizes. (Two sets are \(s\)-co-intersecting if their complements are \(s\)-intersecting.) Several conjectures are proved while others are shown not to be correct. The exact results are accompanied by asymptotic ones. One of the main tool is proper use of weight functions.
    0 references
    Erdős-Ko-Rado theorem
    0 references
    Ahlswede-Khachatrian theorem
    0 references
    truncated Boolean algebra
    0 references
    intersecting systems
    0 references
    co-intersecting systems
    0 references

    Identifiers