WorksMathematics
Set-coloring Ramsey numbers with multiple intersections
Abstract
For integers , we introduce the Ramsey number , defined as the least such that every assignment of an -element subset of to each edge of yields a copy of whose edges have at least colors in common. This generalizes the classical set-coloring Ramsey number , studied since the work of Erdos, Hajnal, and Rado. We show that cannot in general be eliminated by reparametrization: infinitely many quadruples satisfy for every . Writing , the shadow inequality and the recent proof of the Erdos–Sos conjecture imply for every -vertex tree . For stars, we obtain packing bounds and exact values under suitable divisibility conditions. For paths and even cycles of order , we improve the upper bound to as , for fixed and some . We also prove that, for fixed , the tree bound is asymptotically sharp for paths as , and for even cycles when first and then . For cliques , we transfer known bounds of Conlon et al. for ordinary set-coloring Ramsey numbers to the general parameter , obtaining two-sided exponential bounds. For each fixed , we identify an explicit piecewise-linear function that determines a growth threshold. If and as , with , then when , whereas for some when .