The Ramsey numbers of large star and large star-like trees versus odd wheels

摘要

For two given graphs G and H, the Ramsey number R(G, H) is the smallest positive integer N such that for every graph F of order N the following holds: either F contains G as a subgraph or the complement of F contains H as a subgraph. In this paper, we sha