The Ramsey numbers for some subgraphs of generalized wheels versus cycles and paths
2015 ◽
Vol 69
(2)
◽
pp. 1
The Ramsey number \(R(G, H)\) for a pair of graphs \(G\) and \(H\) is defined as the smallest integer \(n\) such that, for any graph \(F\) on \(n\) vertices, either \(F\) contains \(G\) or \(\overline{F}\) contains \(H\) as a subgraph, where \(\overline{F}\) denotes the complement of \(F\). 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 \(R(K_1+L_n, P_m)\) and \(R(K_1+L_n, C_m)\) for some integers \(m\), \(n\), where \(L_n\) is a linear forest of order \(n\) with at least one edge.
Keyword(s):
Keyword(s):
2009 ◽
Vol 18
(1-2)
◽
pp. 247-258
◽
Keyword(s):
2011 ◽
Vol 22
(01)
◽
pp. 29-38
◽
Keyword(s):
1993 ◽
Vol 2
(4)
◽
pp. 389-399
◽
Keyword(s):
1981 ◽
Vol 30
(3)
◽
pp. 284-296
◽
Keyword(s):