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 .
Recommendations
Cites work
- scientific article; zbMATH DE number 5054101 (Why is no real title available?)
- Cycles in bipartite graphs
- Some Theorems on Abstract Graphs
- THE RAMSEY NUMBERS FOR STARS OF ODD ORDER VERSUS A WHEEL OF ORDER NINE
- The Ramsey numbers for stars of even order versus a wheel of order nine
- The Ramsey numbers of stars versus wheels
- Weakly pancyclic graphs
Cited in
(10)- Ramsey numbers of stars versus wheels of similar sizes
- scientific article; zbMATH DE number 5054101 (Why is no real title available?)
- Star-critical Ramsey numbers of wheels versus odd cycles
- scientific article; zbMATH DE number 5310068 (Why is no real title available?)
- The Ramsey numbers of trees versus generalized 6-wheels or generalized 7-wheels
- A note on the Ramsey number of even wheels versus stars
- An exact formula for all star-kipas Ramsey numbers
- Wheel and star-critical Ramsey numbers for quadrilateral
- Some star-critical Ramsey numbers
- The Ramsey numbers for trees of large maximum degree versus the wheel graph \(W_8\)
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)