Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
5777382 | European Journal of Combinatorics | 2017 | 25 Pages |
Abstract
Let Sn be the symmetric group on [n]={1,â¦,n}. The k-point fixing graph F(n,k) is defined to be the graph with vertex set Sn such that two vertices g, h of F(n,k) are joined if and only if ghâ1 fixes exactly k points. In this paper, we show that for sufficiently large n in terms of k the smallest eigenvalue of F(n,k) occurs at the partition (nât0,t0) where t0 is the smallest positive integer satisfying âr=0t0(kr)(â1)t0âr(t0âr)!<0. It was conjectured by Ellis in Ellis (2014) that if A is an independent set in F(n,k), then |A|â¤(nâkâ1)! for sufficiently large n. Our result implies that |A|â¤Ok((nâkâ12)!) for sufficiently large n.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Cheng Yeaw Ku, Terry Lau, Kok Bin Wong,