AbstractLet 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 mq(n,k,t)=maxn−tk−t, 2k−tk for n⩾2k−t while for n⩽2k−t trivially mq(n,k,t)=nk holds
AbstractWe consider the following vector space analogue of problem in extremal set theory.Let g(k, l...
AbstractWe consider the following vector space analogue of problem in extremal set theory.Let g(k, l...
We show for k ≥ 2 that if q ≥ 3 and n ≥ 2k + 1, or q = 2 and n ≥ 2k + 2, then any intersecting famil...
AbstractLet V be an n-dimensional vector space over GF(q) and for integers k⩾t>0 let mq(n, k, t) den...
AbstractThe exact bound in the Erdős-Ko-Rado theorem is known [F, W]. It states that if n ⩾ (t + 1)(...
AbstractA family F of distinct k-element subsets of the n-element set X is called intersecting if F ...
For positive integers k and n define E (k, n) = {a = (a1 , . . . , an): ai ∈ {0,1, . . . , k - 1 }, ...
AbstractA theorem of Erdös, Ko and Rado states that if S is an n-element set and F is a family of k-...
AbstractThe exact bound in the Erdős-Ko-Rado theorem is known [F, W]. It states that if n ⩾ (t + 1)(...
AbstractLet m(n,k,r,t) be the maximum size of F⊂[n]k satisfying |F1∩⋯∩Fr|≥t for all F1,…,Fr∈F. We pr...
AbstractMotivated by the Frankl's results in [P. Frankl, Multiply-intersecting families, J. Combin. ...
We prove an Erdos-Ko-Rado-type theorem for intersecting k-chains of subspaces of a finite vector sp...
AbstractLet A and B be families of k and l element subsets of an n element set, respectively. Suppos...
The celebrated Erd\H{o}s-Ko-Rado theorem \cite{EKR1961} states that the maximum intersecting $k$-uni...
AbstractWe answer the following question: When does a k-uniform family generated by some rank t elem...
AbstractWe consider the following vector space analogue of problem in extremal set theory.Let g(k, l...
AbstractWe consider the following vector space analogue of problem in extremal set theory.Let g(k, l...
We show for k ≥ 2 that if q ≥ 3 and n ≥ 2k + 1, or q = 2 and n ≥ 2k + 2, then any intersecting famil...
AbstractLet V be an n-dimensional vector space over GF(q) and for integers k⩾t>0 let mq(n, k, t) den...
AbstractThe exact bound in the Erdős-Ko-Rado theorem is known [F, W]. It states that if n ⩾ (t + 1)(...
AbstractA family F of distinct k-element subsets of the n-element set X is called intersecting if F ...
For positive integers k and n define E (k, n) = {a = (a1 , . . . , an): ai ∈ {0,1, . . . , k - 1 }, ...
AbstractA theorem of Erdös, Ko and Rado states that if S is an n-element set and F is a family of k-...
AbstractThe exact bound in the Erdős-Ko-Rado theorem is known [F, W]. It states that if n ⩾ (t + 1)(...
AbstractLet m(n,k,r,t) be the maximum size of F⊂[n]k satisfying |F1∩⋯∩Fr|≥t for all F1,…,Fr∈F. We pr...
AbstractMotivated by the Frankl's results in [P. Frankl, Multiply-intersecting families, J. Combin. ...
We prove an Erdos-Ko-Rado-type theorem for intersecting k-chains of subspaces of a finite vector sp...
AbstractLet A and B be families of k and l element subsets of an n element set, respectively. Suppos...
The celebrated Erd\H{o}s-Ko-Rado theorem \cite{EKR1961} states that the maximum intersecting $k$-uni...
AbstractWe answer the following question: When does a k-uniform family generated by some rank t elem...
AbstractWe consider the following vector space analogue of problem in extremal set theory.Let g(k, l...
AbstractWe consider the following vector space analogue of problem in extremal set theory.Let g(k, l...
We show for k ≥ 2 that if q ≥ 3 and n ≥ 2k + 1, or q = 2 and n ≥ 2k + 2, then any intersecting famil...