An Erdős--Ko--Rado theorem for partial permutations (Q817754): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
(5 intermediate revisions by 4 users not shown)
Property / reviewed by
 
Property / reviewed by: Péter L. Erdős / rank
Normal rank
 
Property / reviewed by
 
Property / reviewed by: Péter L. Erdős / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.disc.2005.11.007 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1991110565 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3741626 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Erdős-Ko-Rado theorem for signed sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intersecting families of permutations / 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: INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extensions of the Erdös-Ko-Rado Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stable sets of maximal size in Kneser-type graphs / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Revision as of 11:06, 24 June 2024

scientific article
Language Label Description Also known as
English
An Erdős--Ko--Rado theorem for partial permutations
scientific article

    Statements

    An Erdős--Ko--Rado theorem for partial permutations (English)
    0 references
    0 references
    20 March 2006
    0 references
    An \(r\)-partial permutation of \([n]\) is an ordered pair \((A,f)\) where \(A\subset [n]\) has \(r\) elements and \(f:A\rightarrow [n]\) is an injective map. Two such animals are intersecting if their set components contain a common element having the same image under their respective maps. The main result of this paper is that the Erdős-Ko-Rado families have always maximal cardinality among the intersecting systems. Furthermore the authors show that for the majority of cases the maximum pairwise intersecting families of partial permutations have the familiar Erdős-Ko-Rado structure.
    0 references
    intersecting families
    0 references

    Identifiers