{"paper":{"title":"Stars versus stripes Ramsey numbers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"G. Raeisi, G.R. Omidi, Z. Rahimi","submitted_at":"2017-01-16T06:52:14Z","abstract_excerpt":"For given simple graphs $G_1, G_2, \\ldots , G_t$, the Ramsey number $R(G_1, G_2, \\ldots, G_t)$ is the smallest positive integer $n$ such that if the edges of the complete graph $K_n$ are partitioned into $t$ disjoint color classes giving $t$ graphs $H_1,H_2,\\ldots,H_t$, then at least one $H_i$ has a subgraph isomorphic to $G_i$. In this paper, for positive integers $t_1,t_2,\\ldots, t_s$ and $n_1,n_2,\\ldots, n_c$ the Ramsey number $R(S_{t_1}, S_{t_2},\\ldots ,S_{t_s}, n_1K_2,n_2K_2,\\ldots,n_cK_2)$ is computed, where $nK_2$ denotes a matching (stripe) of size $n$, i.e., $n$ pairwise disjoint edge"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.04191","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"}