An Erdős-Ko-Rado-type theorem in Coxeter groups. (Q925012): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ejc.2007.07.002 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1999387439 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorics of Coxeter Groups / 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: Intersecting families of permutations / 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: Stable sets of maximal size in Kneser-type graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Erdős-Ko-Rado-type theorems for colored sets / rank
 
Normal rank

Revision as of 10:04, 28 June 2024

scientific article
Language Label Description Also known as
English
An Erdős-Ko-Rado-type theorem in Coxeter groups.
scientific article

    Statements

    An Erdős-Ko-Rado-type theorem in Coxeter groups. (English)
    0 references
    0 references
    0 references
    29 May 2008
    0 references
    symmetric groups
    0 references
    cosets of stabilizers
    0 references
    Coxeter groups
    0 references

    Identifiers