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

From MaRDI portal
Added link to MaRDI item.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(6 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1006/eujc.2002.0590 / rank
Normal rank
 
Property / author
 
Property / author: Q175140 / rank
Normal rank
 
Property / reviewed by
 
Property / reviewed by: Péter L. Erdős / rank
Normal rank
 
Property / author
 
Property / author: Rudolf Ahlswede / rank
 
Normal rank
Property / reviewed by
 
Property / reviewed by: Péter L. Erdős / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1006/eujc.2002.0590 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2021798559 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complete intersection theorem for systems of finite sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: The diametric theorem in Hamming spaces---optimal anticodes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A pushing-pulling method: New proofs of intersection theorems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On families of finite sets with bounds on unions and intersections / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotic Methods in Enumeration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4945051 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4338928 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Erdős-Ko-Rado theorem for integer sequences of given rank / rank
 
Normal rank
Property / cites work
 
Property / cites work: INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS / rank
 
Normal rank
Property / cites work
 
Property / cites work: The proof of a conjecture of G. O. H. Katona / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4871772 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3996856 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intersection theorems for systems of finite sets / 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