Upper bounds for the size of ordered $L$-intersecting set systems
Fuente:
arXiv
Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866912109053345792 |
|---|---|
| author | Hegedüs, Gábor |
| author_facet | Hegedüs, Gábor |
| contents | A family $\mbox{$\cal F$}=\{F_1,\ldots,F_m\}$ of subsets of $[n]$ is said to be ordered, if there exists an $1\leq r\leq m$ index such that $n\in F_i$ for each $1\leq i\leq r$, $n\notin F_i$ for each $i>r$ and $|F_i|\leq |F_j|$ for each $1\leq i<j\leq m$.
Our main result is a new upper bound for the size of ordered $L$-intersecting set systems. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2411_04618 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Upper bounds for the size of ordered $L$-intersecting set systems Hegedüs, Gábor Combinatorics 05D05, 12D99, 15A03 A family $\mbox{$\cal F$}=\{F_1,\ldots,F_m\}$ of subsets of $[n]$ is said to be ordered, if there exists an $1\leq r\leq m$ index such that $n\in F_i$ for each $1\leq i\leq r$, $n\notin F_i$ for each $i>r$ and $|F_i|\leq |F_j|$ for each $1\leq i<j\leq m$. Our main result is a new upper bound for the size of ordered $L$-intersecting set systems. |
| title | Upper bounds for the size of ordered $L$-intersecting set systems |
| topic | Combinatorics 05D05, 12D99, 15A03 |
| url | https://arxiv.org/abs/2411.04618 |