{"paper":{"title":"A note on the Ramsey number of even wheels versus stars","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"H. R. Maimani, Sh. Haghi","submitted_at":"2015-10-28T21:09:26Z","abstract_excerpt":"For two graphs $G_1$ and $G_2$ the Ramsey number $R(G_1,G_2)$ is the smallest integer $N$, such that for any graph on $N$ vertices either $G$ contains $G_1$ or $\\overline{G}$ contains $G_2$. Let $S_n$ be a star of order $n$ and $W_m$ be a wheel of order $m+1$. In this paper, it is shown that $R(W_n,S_n)\\leq{5n/2-1}$, where $n\\geq{6}$ is even. It was proven a theorem which implies that $R(W_n,S_n)\\geq{5n/2-2}$, where $n\\geq{6}$ is even. Therefore we conclude that $R(W_n,S_n)=5n/2-2$ or $5n/2-1$, for $n\\geq{6}$ and even."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.08488","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}