On star-wheel Ramsey numbers

From MaRDI portal
Publication:295255

DOI10.1007/S00373-015-1594-6zbMATH Open1338.05178arXiv1503.01165OpenAlexW2162263152MaRDI QIDQ295255FDOQ295255


Authors: Ingo Schiermeyer, Binlong Li Edit this on Wikidata


Publication date: 13 June 2016

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Abstract: For two given graphs G1 and G2, the Ramsey number R(G1,G2) is the least integer r such that for every graph G on r vertices, either G contains a G1 or contains a G2. In this note, we determined the Ramsey number R(K1,n,Wm) for even m with n+2leqmleq2n2, where Wm is the wheel on m+1 vertices, i.e., the graph obtained from a cycle Cm by adding a vertex v adjacent to all vertices of the Cm.


Full work available at URL: https://arxiv.org/abs/1503.01165




Recommendations




Cites Work


Cited In (10)





This page was built for publication: On star-wheel Ramsey numbers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q295255)