A new proof of the Erdős-Ko-Rado theorem for intersecting families of permutations (Q1003591): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q750451
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Chris D. Godsil / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: GAP / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1995234636 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 0710.2109 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cycle decompositions. IV: Complete directed graphs and fixed length directed cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3218140 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nombres de coloration de l'hypergraphe h-parti complet / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intersecting families of permutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5707657 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Erdös–Ko–Rado Theorem—22 Years Later / 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 Erdős-Ko-Rado theorem for vector spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the maximum number of permutations with given maximal or minimal distance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4002278 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Problems in algebraic combinatorics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chromatic number and the 2-rank of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independent sets in association schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4352272 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An existence theorem for latin squares / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intersection theorems for systems of finite vector spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stable sets of maximal size in Kneser-type graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Erdős-Ko-Rado theorems for uniform set-partition systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An extension of the Erdoes, Ko, Rado theorem to t-designs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the spectrum of the derangement graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2716065 / rank
 
Normal rank

Latest revision as of 03:34, 29 June 2024

scientific article
Language Label Description Also known as
English
A new proof of the Erdős-Ko-Rado theorem for intersecting families of permutations
scientific article

    Statements

    A new proof of the Erdős-Ko-Rado theorem for intersecting families of permutations (English)
    0 references
    0 references
    0 references
    4 March 2009
    0 references
    0 references
    0 references
    0 references
    0 references
    Erdős-Ko-Rado theorem
    0 references
    permutations
    0 references
    intersections
    0 references
    extremal combinatorics
    0 references
    0 references
    0 references