The s-chromatic Ramsey number for stars
Abstract
In 1977, Chung, Chung and Liu generalized the definition of the Ramsey number. They introduced the s-chromatic Ramsey number as follows. Let 1≤ s< t be integers and let A1, A2, …, Ac be subsets with size s of [t], where c= t s. For given graphs G1, G2, …, Gc, the s-chromatic Ramsey number rs, t(G1, G2, …, Gc), is the minimum positive integer N such that every t-coloring of E(KN) yields a copy of Gi whose edges are colored by colors in the color set Ai for some i∈ [c]. The star-critical s-chromatic Ramsey number r*s, t(G1, G2, …, Gc), is the minimum integer such that every t-coloring of the edges in KN- E(K1, N- 1- ) yields a copy of Gi whose edges are colored by colors in the color set Ai for some i∈ [c], where N= rs, t(G1, G2, …, Gc). If G1= G2= …= Gc= G, then we simplify them to rs, t(G) (also called the weakened Ramsey number) and rs, t*(G), respectively. In this paper, we determine all the values of rs, t(K1, m) and r*s, t(K1, m), and part of the value of rs, t(K1, m1, K1, m2, …, K1, mc).
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.