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
Publication date: 13 June 2016
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Abstract: For two given graphs and , the Ramsey number is the least integer such that for every graph on vertices, either contains a or contains a . In this note, we determined the Ramsey number for even with , where is the wheel on vertices, i.e., the graph obtained from a cycle by adding a vertex adjacent to all vertices of the .
Full work available at URL: https://arxiv.org/abs/1503.01165
Recommendations
Cites Work
Cited In (10)
- Title not available (Why is that?)
- The Ramsey numbers for trees of large maximum degree versus the wheel graph \(W_8\)
- Wheel and star-critical Ramsey numbers for quadrilateral
- Title not available (Why is that?)
- An exact formula for all star-kipas Ramsey numbers
- The Ramsey numbers of trees versus generalized 6-wheels or generalized 7-wheels
- Some star-critical Ramsey numbers
- Star-critical Ramsey numbers of wheels versus odd cycles
- A note on the Ramsey number of even wheels versus stars
- Ramsey numbers of stars versus wheels of similar sizes
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)