{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T16:44:01Z","timestamp":1753893841877,"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>We write $F{\\buildrel {\\text{ind}} \\over \\longrightarrow}(H,G)$ for graphs $F, G,$ and $H$, if for any coloring of the edges of $F$ in red and blue, there is either a red induced copy of $H$ or a blue induced copy of $G$. For graphs $G$ and $H$, let $\\mathrm{IR}(H,G)$ be the smallest number of vertices in a graph $F$ such that $F{\\buildrel {\\text{ind}} \\over \\longrightarrow}(H,G)$.\r\nIn this note we consider the case when $G$ is a star on $n$ edges, for large $n$ and $H$ is a fixed graph. We prove that\u00a0 $$ (\\chi(H)-1) n \\leq \\mathrm{IR}(H, K_{1,n}) \\leq (\\chi(H)-1)^2n + \\epsilon n,$$ for any $\\epsilon&gt;0$,\u00a0 sufficiently large $n$, and $\\chi(H)$ denoting the chromatic number of $H$. The lower bound is asymptotically tight\u00a0 for any fixed bipartite $H$. The upper bound is attained up to a constant factor, for example when $H$ is a clique.<\/jats:p>","DOI":"10.37236\/9358","type":"journal-article","created":{"date-parts":[[2021,3,26]],"date-time":"2021-03-26T05:59:03Z","timestamp":1616738343000},"source":"Crossref","is-referenced-by-count":0,"title":["Induced Ramsey Number for a Star Versus a Fixed Graph"],"prefix":"10.37236","volume":"28","author":[{"given":"Maria","family":"Axenovich","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Izolda","family":"Gorgol","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"23455","published-online":{"date-parts":[[2021,3,26]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v28i1p55\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v28i1p55\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,3,26]],"date-time":"2021-03-26T05:59:03Z","timestamp":1616738343000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v28i1p55"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,3,26]]},"references-count":0,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2021,1,14]]}},"URL":"https:\/\/doi.org\/10.37236\/9358","relation":{},"ISSN":["1077-8926"],"issn-type":[{"type":"electronic","value":"1077-8926"}],"subject":[],"published":{"date-parts":[[2021,3,26]]},"article-number":"P1.55"}}