Elsevier

Discrete Mathematics

Volume 306, Issue 1, 28 January 2006, Pages 74-86
Discrete Mathematics

An Erdős–Ko–Rado theorem for partial permutations

https://doi.org/10.1016/j.disc.2005.11.007Get rights and content
Under an Elsevier user license
open archive

Abstract

Let [n] denote the set of positive integers {1,2,,n}. An r-partial permutation of [n] is a pair (A,f) where A[n], |A|=r and f:A[n] is an injective map. A set A of r-partial permutations is intersecting if for any (A,f), (B,g)A, there exists xAB such that f(x)=g(x). We prove that for any intersecting family A of r-partial permutations, we have |A|n-1r-1((n-1)!/(n-r)!).

It seems rather hard to characterize the case of equality. For 8rn-3, we show that equality holds if and only if there exist x0 and ε0 such that A consists of all (A,f) for which x0A and f(x0)=ε0.

Keywords

Intersecting families
Erdős–Ko–Rado
Permutations
Partial permutations

Cited by (0)

1

Current address: Caltech, 1200 E. California Blvd, Mail Code 253-37, Pasadena, CA 91125, USA.