Skip to content
Snippets Groups Projects
Commit 26f7beee authored by Fabian Nuraddin Alexander Gabel's avatar Fabian Nuraddin Alexander Gabel :speech_balloon:
Browse files

Merge branch '69-topic-not-included' into 'dev'

Resolve "topic not included"

Closes #69

See merge request !102
parents 1956e447 1a99f1d6
No related branches found
No related tags found
2 merge requests!113newest updates,!102Resolve "topic not included"
Pipeline #106485 passed
# $r$-cross $t$-intersecting families via necessary intersection points
# r-cross t-intersecting families via necessary intersection points
### Working Groups: dm
......@@ -10,7 +10,6 @@
Given integers $r\geq 2$ and $n,t\geq 1$ we call families $\mathcal{F}_1,\dots,\mathcal{F}_r\subseteq\mathscr{P}([n])$ $r$-cross $t$-intersecting if for all $F_i\in\mathcal{F}_i$, $i\in[r]$, we have $\vert\bigcap_{i\in[r]}F_i\vert\geq t$. We obtain a strong generalisation of the classic Hilton-Milner theorem on cross intersecting families. In particular, we determine the maximum of $\sum_{j\in [r]}\vert\mathcal{F}_j\vert$ for $r$-cross $t$-intersecting families in the cases when these are $k$-uniform families or arbitrary subfamilies of $\mathscr{P}([n])$. Only some special cases of these results had been proved before. We obtain the aforementioned theorems as instances of a more general result that considers measures of $r$-cross $t$-intersecting families. This also provides the maximum of $\sum_{j\in [r]}\vert\mathcal{F}_j\vert$ for families of possibly mixed uniformities $k_1,\ldots,k_r$.
## References
[1] [P. Gupta, Y. Mogge, S. Piga, and B. Schülke. $r$-cross $t$-intersecting families via necessary intersection points, arXiv:2010.11928 (2020)](https://arxiv.org/abs/2010.11928)
\ No newline at end of file
0% Loading or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment