Stable sets of maximal size in Kneser-type graphs

2003/12/04 by Benoît Larose, Benoit Larose, Claudia Malvenuto · 2 citations
Mathematics · #1-planar graph #Automorphism #Chordal graph #Combinatorics #Discrete mathematics #Finite Group Theory Research #Graph #Graph theory and applications #Indifference graph #Limits and Structures in Graph Theory #Mathematics #Maximal independent set #Transitive relation #Vertex (graph theory)

paper · pdf · doi:10.1016/j.ejc.2003.10.006

openalex publication_date 2003/12/04 · crossref created 2003/12/04 · crossref issued 2004/07/01 · crossref published 2004/07/01 · crossref published-print 2004/07/01 · crossref deposited 2019/02/16 · openalex created_date 2025/10/10 · crossref indexed 2026/04/30 · openalex updated_date 2026/07/31

Citations

• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• On the maximum number of permutations with given maximal or minimal distance
• Intersecting families of permutations
• SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS

Cited by

• A new proof of the Erdős–Ko–Rado theorem for intersecting families of permutations
• Erdős–Ko–Rado theorem [wikipedia]