AbstractLet 1⩽r<n be integers and H a family of subsets of an n-element set such that 1⩽ |H∩H1|⩽r holds for all H, H1 ϵ H. Frankl and Füredi [3] proved that |H|⩽(n−10)+⋯+(n−1r) holds for n > 100r2log r and this is best possible. In this paper it is proved by using a new type of permutation method that the same holds for 6(r+1)⩽n⩽15(r+1)2
A family $\mathcal{F}$ of subsets of $\{1,2,\ldots,n\}$ is called a $t$-intersecting family if $|F\c...
AbstractSuppose that A is a finite set-system on N points, and for everytwo different A, A′ϵ A we ha...
AbstractThis paper is a survey of open problems and results involving extremal size of collections o...
AbstractFollowing a conjecture of P. Erdös, we show that if F is a family of k-subsets of and n-set ...
AbstractLet 1⩽r<n be integers and H a family of subsets of an n-element set such that 1⩽ |H∩H1|⩽r ho...
AbstractFix integers n,r⩾4 and let F denote a family of r-sets of an n-element set. Suppose that for...
AbstractLet p be a prime and let L={l1,l2,…,ls} and K={k1,k2,…,kr} be two subsets of {0,1,2,…,p−1} s...
AbstractA family F of distinct k-element subsets of the n-element set X is called intersecting if F ...
AbstractLet X = [1, n] be a finite set of cardinality n and let F be a family of k-subsets of X. Sup...
AbstractLet A and B be systems of k and l element subsets of an n element set respectively. Suppose ...
AbstractThe Erdös-Ko-Rado theorem states that if F is a family of k-subsets of an n-set no two of wh...
AbstractLet X be a finite set of n-melements and suppose t ⩾ 0 is an integer. In 1975, P. Erdös aske...
AbstractThe exact bound in the Erdős-Ko-Rado theorem is known [F, W]. It states that if n ⩾ (t + 1)(...
AbstractLet F be a family of subsets of an n-element set. F is said to be of type (n, r, s) if A ∈ F...
AbstractA family F is intersecting if F∩F′≠∅ whenever F,F′∈F. Erdős, Ko, and Rado (1961) [6] showed ...
A family $\mathcal{F}$ of subsets of $\{1,2,\ldots,n\}$ is called a $t$-intersecting family if $|F\c...
AbstractSuppose that A is a finite set-system on N points, and for everytwo different A, A′ϵ A we ha...
AbstractThis paper is a survey of open problems and results involving extremal size of collections o...
AbstractFollowing a conjecture of P. Erdös, we show that if F is a family of k-subsets of and n-set ...
AbstractLet 1⩽r<n be integers and H a family of subsets of an n-element set such that 1⩽ |H∩H1|⩽r ho...
AbstractFix integers n,r⩾4 and let F denote a family of r-sets of an n-element set. Suppose that for...
AbstractLet p be a prime and let L={l1,l2,…,ls} and K={k1,k2,…,kr} be two subsets of {0,1,2,…,p−1} s...
AbstractA family F of distinct k-element subsets of the n-element set X is called intersecting if F ...
AbstractLet X = [1, n] be a finite set of cardinality n and let F be a family of k-subsets of X. Sup...
AbstractLet A and B be systems of k and l element subsets of an n element set respectively. Suppose ...
AbstractThe Erdös-Ko-Rado theorem states that if F is a family of k-subsets of an n-set no two of wh...
AbstractLet X be a finite set of n-melements and suppose t ⩾ 0 is an integer. In 1975, P. Erdös aske...
AbstractThe exact bound in the Erdős-Ko-Rado theorem is known [F, W]. It states that if n ⩾ (t + 1)(...
AbstractLet F be a family of subsets of an n-element set. F is said to be of type (n, r, s) if A ∈ F...
AbstractA family F is intersecting if F∩F′≠∅ whenever F,F′∈F. Erdős, Ko, and Rado (1961) [6] showed ...
A family $\mathcal{F}$ of subsets of $\{1,2,\ldots,n\}$ is called a $t$-intersecting family if $|F\c...
AbstractSuppose that A is a finite set-system on N points, and for everytwo different A, A′ϵ A we ha...
AbstractThis paper is a survey of open problems and results involving extremal size of collections o...