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
AbstractA union closed (UC) family A is a finite family of sets such that the union of any two sets ...
For a family $\mathcal F$, let $\mathcal D(\mathcal F)$ stand for the family of all sets that can be...
AbstractA family F of distinct k-element subsets of the n-element set X is called intersecting if F ...
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...
Frankl’s conjecture states that in a family of sets closed by union F such that F 6= {∅}, there is a...
AbstractWe give a simple linear algebraic proof of the following conjecture of Frankl and Füredi [7,...
The families \(\mathcal{F}_0,\ldots,\mathcal{F}_s\) of \(k\)-element subsets of \([n]:=\{1,2,\ldots,...
AbstractLet X be a finite set of n-melements and suppose t ⩾ 0 is an integer. In 1975, P. Erdös aske...
We give a new proof of the Frankl-Rödl theorem on forbidden intersections, via the probabilistic met...
We give a new proof of the Frankl-Rödl theorem on forbidden intersections, via the probabilistic met...
We give a new proof of the Frankl-Rödl theorem on forbidden intersections, via the probabilistic met...
In 1965 Erd\H{o}s asked, what is the largest size of a family of $k$-elements subsets of an $n$-elem...
We give a simple linear algebraic proof of the following conjecture of Frankl and Furedi [7, 9, 13]....
Ahlswede R, Khachatrian LH. Counterexample to the Frankl-Pach conjecture for uniform, dense families...
AbstractA union closed (UC) family A is a finite family of sets such that the union of any two sets ...
For a family $\mathcal F$, let $\mathcal D(\mathcal F)$ stand for the family of all sets that can be...
AbstractA family F of distinct k-element subsets of the n-element set X is called intersecting if F ...
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...
Frankl’s conjecture states that in a family of sets closed by union F such that F 6= {∅}, there is a...
AbstractWe give a simple linear algebraic proof of the following conjecture of Frankl and Füredi [7,...
The families \(\mathcal{F}_0,\ldots,\mathcal{F}_s\) of \(k\)-element subsets of \([n]:=\{1,2,\ldots,...
AbstractLet X be a finite set of n-melements and suppose t ⩾ 0 is an integer. In 1975, P. Erdös aske...
We give a new proof of the Frankl-Rödl theorem on forbidden intersections, via the probabilistic met...
We give a new proof of the Frankl-Rödl theorem on forbidden intersections, via the probabilistic met...
We give a new proof of the Frankl-Rödl theorem on forbidden intersections, via the probabilistic met...
In 1965 Erd\H{o}s asked, what is the largest size of a family of $k$-elements subsets of an $n$-elem...
We give a simple linear algebraic proof of the following conjecture of Frankl and Furedi [7, 9, 13]....
Ahlswede R, Khachatrian LH. Counterexample to the Frankl-Pach conjecture for uniform, dense families...
AbstractA union closed (UC) family A is a finite family of sets such that the union of any two sets ...
For a family $\mathcal F$, let $\mathcal D(\mathcal F)$ stand for the family of all sets that can be...
AbstractA family F of distinct k-element subsets of the n-element set X is called intersecting if F ...
DOI
Add to ORKG