Asymptotic upper bounds on the shades of t-intersecting families
| dc.creator | Hirschorn, James | |
| dc.date | 2008-08-11 | |
| dc.date.accessioned | 2026-07-07T09:55:56Z | |
| dc.date.available | 2026-07-07T09:55:56Z | |
| dc.description | We examine the m-shades of t-intersecting families of k-subsets of [n], and conjecture on the optimal upper bound on their cardinalities. This conjecture extends Frankl's General Conjecture that was proven true by Ahlswede-Khachatrian. From this we deduce the precise asymptotic upper bounds on the cardinalities of m-shades of t(m)-intersecting families of k(m)-subsets of [2m], as m -> infinity. A generalization to cross-t-intersecting families is also considered. | |
| dc.description | 8 pages. Homepage of the paper will be: http://homepage.univie.ac.at/James.Hirschorn/research/asymptotic.ub/asymptotic.ub.html | |
| dc.identifier | https://arxiv.org/abs/0808.1434 | |
| dc.identifier | http://arxiv.org/abs/0808.1434 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/166805 | |
| dc.subject | Combinatorics | |
| dc.subject | Logic | |
| dc.subject | 05D05 (Primary); 03E15, 05D40 (Secondary) | |
| dc.title | Asymptotic upper bounds on the shades of t-intersecting families | |
| dc.type | text |