The Erdös-Ko-Rado theorem for vector spaces
暂无分享,去创建一个
Abstract Let V be an n-dimensional vector space over GF(q) and for integers k⩾t>0 let mq(n, k, t) denote the maximum possible number of subspaces in a t-intersecting family F of k-dimensional subspaces of V, i.e., dim F ∩ F′ ⩾ t holds for all F, F′ ϵ F . It is shown that m q (n,k,t)= max n−t k−t , 2k−t k for n⩾2k−t while for n⩽2k−t trivially m q (n,k,t)= n k holds.
[1] Peter Frankl,et al. Erdös–Ko–Rado Theorem—22 Years Later , 1983 .
[2] P. Erdös,et al. INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS , 1961 .
[3] Richard M. Wilson,et al. The exact bound in the Erdös-Ko-Rado theorem , 1984, Comb..
[4] W. N. Hsieh,et al. Intersection theorems for systems of finite vector spaces , 1975, Discret. Math..
[5] D. Kleitman,et al. Proof techniques in the theory of finite sets , 1978 .