Multiply intersecting families of sets (Q1826948): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.jcta.2004.03.003 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2091849910 / rank
 
Normal rank

Revision as of 01:22, 20 March 2024

scientific article
Language Label Description Also known as
English
Multiply intersecting families of sets
scientific article

    Statements

    Multiply intersecting families of sets (English)
    0 references
    0 references
    0 references
    6 August 2004
    0 references
    This paper studies \(r\)-wise \(s\)-intersecting set systems on an \(n\)-element underlying set, where there is also an upper size-restriction on the intersections: the cardinality of the intersection of any \(l\) sets is at most \(t.\) The authors prove a tight upper bound \((l-1)n\) for the case \(s=1\) and \(l=1.\) They also give the asymptotic solution for the general case.
    0 references
    \(r\)-wise \(s\)-intersecting set systems
    0 references
    non-trivial intersection, Hamming ball
    0 references

    Identifiers