{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T16:43:11Z","timestamp":1753893791344,"version":"3.41.2"},"reference-count":0,"publisher":"The Electronic Journal of Combinatorics","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electron. J. Combin."],"abstract":"<jats:p>For graphs $G$ and $H$, the Ramsey number $R(G,H)$ is the minimum integer $N$ such that any red\/blue edge coloring of $K_N$ contains either a red $G$ or a blue $H$. Let $\\chi(G)$ be the chromatic number of $G$, and $s(G)$ the minimum size of a color class over all proper vertex colorings of $G$ with $\\chi(G)$ colors. A connected graph $H$ is called $G$-{\\em good} if $R(G,H)= (\\chi(G)-1)(|H|-1)+s(G)$. For graphs $G$ and $H$, it is shown $K_p+nH$ is $(K_2+G)$-{\\em good}, where $n$ is double-exponential in terms of $p,|G|,|H|$, and $K_p+nH$ is $C_{2m+1}$-{\\em good} for $n\\ge (100q)^{8q^3}$, where $q=\\max\\{m,p,|H|\\}$. Both proofs are short that avoids using the regularity method.<\/jats:p>","DOI":"10.37236\/11579","type":"journal-article","created":{"date-parts":[[2024,1,26]],"date-time":"2024-01-26T09:52:57Z","timestamp":1706262777000},"source":"Crossref","is-referenced-by-count":0,"title":["A Note on Ramsey Numbers Involving Large Books"],"prefix":"10.37236","volume":"31","author":[{"given":"Meng","family":"Liu","sequence":"first","affiliation":[]},{"given":"Yusheng","family":"Li","sequence":"additional","affiliation":[]}],"member":"23455","published-online":{"date-parts":[[2024,1,12]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v31i1p7\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v31i1p7\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,26]],"date-time":"2024-01-26T09:52:57Z","timestamp":1706262777000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v31i1p7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,1,12]]},"references-count":0,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2024,1,12]]}},"URL":"https:\/\/doi.org\/10.37236\/11579","relation":{},"ISSN":["1077-8926"],"issn-type":[{"type":"electronic","value":"1077-8926"}],"subject":[],"published":{"date-parts":[[2024,1,12]]},"article-number":"P1.7"}}