For graphs $F$, $G$, and $H$, we write $F \to (G, H)$ if every red/blue edge-coloring of $F$ contains either a red copy of $G$ or a blue copy of $H$. The Ramsey number $R(G, H)$ is the smallest integer $N$ such that $K_N \to (G, H)$. Let $H := K_k + nK_h$ be the generalized book graph, and let $G := K_{p+1}(a_1, a_2, \...
The set-coloring Ramsey number $R(k;r,s)$ is the least $N$ such that every assignment of an $s$-element subset of $[r]$ to each edge of $K_N$ yields a copy of $K_k$ whose edges share a common color. For every fixed prime power $q$, we construct infinitely many positive integer triples $(r,j,s)$ with $j\sim(q-1)^{-2/3}r...
Qi-Zhong Lin, Lin Niu· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.