2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/166805We 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.8 pages. Homepage of the paper will be: http://homepage.univie.ac.at/James.Hirschorn/research/asymptotic.ub/asymptotic.ub.htmlCombinatoricsLogic05D05 (Primary); 03E15, 05D40 (Secondary)Asymptotic upper bounds on the shades of t-intersecting familiestext