arXiv Analytics

Sign in

arXiv:2408.00484 [math.CO]AbstractReferencesReviewsResources

On set systems without singleton intersections

Danila Cherkashin

Published 2024-08-01Version 1

Consider a family $\mathcal{F}$ of $k$-subsets of an ambient $(k^2-k+1)$-set such that no pair of $k$-subsets in $\mathcal{F}$ intersects in exactly one element. In this short note we show that the maximal size of such $\mathcal{F}$ is $\binom{k^2-k-1}{k-2}$ for every $k > 1$.

Related articles: Most relevant | Search more
arXiv:1604.01482 [math.CO] (Published 2016-04-06)
Bisecting families for set systems
arXiv:1707.01715 [math.CO] (Published 2017-07-06)
A Common Generalization to Theorems on Set Systems with $\mathcal{L}$-intersections
arXiv:2001.01812 [math.CO] (Published 2020-01-06)
New results on simplex-clusters in set systems