EKR sets for large \(n\) and \(r\) (Q292246): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / arXiv ID
 
Property / arXiv ID: 1210.7470 / 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: Maximum hitting for \(n\) sufficiently large / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum hitting of a set by compressed intersecting families / 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: Q3770569 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new short proof of the EKR theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS / rank
 
Normal rank

Latest revision as of 04:12, 12 July 2024

scientific article
Language Label Description Also known as
English
EKR sets for large \(n\) and \(r\)
scientific article

    Statements

    EKR sets for large \(n\) and \(r\) (English)
    0 references
    0 references
    13 June 2016
    0 references
    Erdős-Ko-Rado theorem
    0 references
    intersecting family
    0 references
    compressed family
    0 references

    Identifiers