An Intersection-Weighted Erdős-Ko-Rado Theorem
Fuente:
arXiv
Salvato in:
| Autore principale: | |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2026
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866910194429067264 |
|---|---|
| author | Tompkins, Casey |
| author_facet | Tompkins, Casey |
| contents | We consider an Erdős-Ko-Rado type sum that weights each member of a uniform family according to its smallest intersection with the rest of the family. We prove that once the ground set is sufficiently large this sum is at most one, with equality exactly for stars. This simultaneously generalizes the usual Erdős-Ko-Rado theorem for every intersection threshold $t$ and $n$ sufficiently large. As a consequence we also obtain an extension of Hilton's theorem on cross-intersecting families. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2605_04799 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | An Intersection-Weighted Erdős-Ko-Rado Theorem Tompkins, Casey Combinatorics We consider an Erdős-Ko-Rado type sum that weights each member of a uniform family according to its smallest intersection with the rest of the family. We prove that once the ground set is sufficiently large this sum is at most one, with equality exactly for stars. This simultaneously generalizes the usual Erdős-Ko-Rado theorem for every intersection threshold $t$ and $n$ sufficiently large. As a consequence we also obtain an extension of Hilton's theorem on cross-intersecting families. |
| title | An Intersection-Weighted Erdős-Ko-Rado Theorem |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2605.04799 |