The Ramsey numbers for some subgraphs of generalized wheels versus cycles and paths
The Ramsey number for a pair of graphs and is defined as the smallest integer such that, for any graph on vertices, either contains or contains as a subgraph, where denotes the complement of . We study Ramsey numbers for some subgraphs of generalized wheels versus cycles and paths and determine these numbers for some cases. We extend many known results studied in [5, 14, 18, 19, 20]. In particular we count the numbers and for some integers , , where is a linear forest...