Is this you? As a journalist, you can create a free Muck Rack account to customize your profile, list your contact preferences, and upload a portfolio of your best work.
Claim your profile
For integers $r\ge s\ge t\ge1$, we introduce the Ramsey number $R(G;r,s,t)$, defined as the least $N$ such that every assignment of an $s$-element subset of $[r]$ to each edge of $K_N$ yields a copy of $G$ whose edges have at least $t$ colors in common. This generalizes the classical set-coloring Ramsey number $R(G;r,s)=R(G;r,s,1)$, studied since the work of Erdos, Hajnal, and Rado.
As a journalist, you can create a free Muck Rack account to customize your profile, list your contact preferences, and upload a portfolio of your best work.