All Ramsey numbers for cycles in graphs
暂无分享,去创建一个
In the past, Ramsey numbers were known for pairs of cycles of lengths r and s when one of the following occurred: (1) r and s are small, (2) one of r or s is small relative to the other, or (3) r is odd and r = s. In this paper we complete the Ramsey number problem for cycles by verifying their previously conjectured values.
[1] P. Erdös,et al. Ramsey Numbers for Cycles in Graphs , 1973 .
[2] John Adrian Bondy,et al. Large cycles in graphs , 1971, Discret. Math..
[3] P. Erdos,et al. On maximal paths and circuits of graphs , 1959 .
[4] Gary Chartrand,et al. On the Existence of Specified Cycles in Complementary Graphs. , 1971 .
[5] J. Bondy,et al. Pancyclic graphs II , 1971 .