Add to ORKGWe show that an $n$-uniform maximal intersecting family has size at most $e^{-n^{0.5+o(1)}}n^n$. This improves a recent bound by Frankl. A recent result by Alweiss et al. on $R$-spread families plays an important role in the proof.Comment: 13 page
For a family $\mathcal F$, let $\mathcal D(\mathcal F)$ stand for the family of all sets that can be...
Two families A and B of sets are cross-t-intersecting if each set in A intersects each set in B in ...
AbstractWe consider the maximal size of families of k-element subsets of an n element set [n] that s...
A family $\mathcal{F}$ of subsets of $\{1,\dots,n\}$ is called $k$-wise intersecting if any $k$ memb...
AbstractWe determine the maximum size of uniform intersecting families with covering number at least...
A family $\mathcal{F}$ on ground set $[n]:=\{1,2,\ldots, n\}$ is maximal $k$-wise intersecting if ev...
AbstractMotivated by the Frankl's results in [P. Frankl, Multiply-intersecting families, J. Combin. ...
AbstractWe determine the maximum size of uniform intersecting families with covering number at least...
We call a family of sets intersecting, if any two sets in the family intersect. In this paper we inv...
We call a family of sets intersecting, if any two sets in the family intersect. In this paper we inv...
AbstractWe discuss the maximum size of uniform intersecting families with covering number at leastτ....
AbstractWe discuss the maximum size of uniform intersecting families with covering number at leastτ....
AbstractIt is shown that the logarithm to the base 2 of the number of maximal intersecting families ...
The celebrated Erdős-Ko-Rado theorem shows that for n≥2k the largest intersecting k-uniform set fami...
A family \(\mathcal{F}\) of subsets of \(\{1,\dots,n\}\) is called \(k\)-wise intersecting if any \(...
For a family $\mathcal F$, let $\mathcal D(\mathcal F)$ stand for the family of all sets that can be...
Two families A and B of sets are cross-t-intersecting if each set in A intersects each set in B in ...
AbstractWe consider the maximal size of families of k-element subsets of an n element set [n] that s...
A family $\mathcal{F}$ of subsets of $\{1,\dots,n\}$ is called $k$-wise intersecting if any $k$ memb...
AbstractWe determine the maximum size of uniform intersecting families with covering number at least...
A family $\mathcal{F}$ on ground set $[n]:=\{1,2,\ldots, n\}$ is maximal $k$-wise intersecting if ev...
AbstractMotivated by the Frankl's results in [P. Frankl, Multiply-intersecting families, J. Combin. ...
AbstractWe determine the maximum size of uniform intersecting families with covering number at least...
We call a family of sets intersecting, if any two sets in the family intersect. In this paper we inv...
We call a family of sets intersecting, if any two sets in the family intersect. In this paper we inv...
AbstractWe discuss the maximum size of uniform intersecting families with covering number at leastτ....
AbstractWe discuss the maximum size of uniform intersecting families with covering number at leastτ....
AbstractIt is shown that the logarithm to the base 2 of the number of maximal intersecting families ...
The celebrated Erdős-Ko-Rado theorem shows that for n≥2k the largest intersecting k-uniform set fami...
A family \(\mathcal{F}\) of subsets of \(\{1,\dots,n\}\) is called \(k\)-wise intersecting if any \(...
For a family $\mathcal F$, let $\mathcal D(\mathcal F)$ stand for the family of all sets that can be...
Two families A and B of sets are cross-t-intersecting if each set in A intersects each set in B in ...
AbstractWe consider the maximal size of families of k-element subsets of an n element set [n] that s...