32
Views
1
CrossRef citations to date
0
Altmetric
Articles

A note on (t - 1)-chromatic Ramsey number of linear forests

ORCID Icon
Pages 92-97 | Received 02 Nov 2019, Accepted 16 Apr 2020, Published online: 15 May 2020

References

  • K.M. Chung, M.L. Chung, and C.L. Liu, A generalization of Ramsey theory for graphs-with stars and complete graphs as forbidden subgraphs, Congr. Numer. 19 (1977), pp. 155–161.
  • K.M. Chung and C.L. Liu, A generalization of Ramsey theory for graphs, Discrete Math. 2 (1978), pp. 117–127. doi: 10.1016/0012-365X(78)90084-5
  • E.J. Cockayne and P.J. Lorimer, The Ramsey number for stripes, J. Aust. Math. Soc. Series A 19 (1975), pp. 252–256. doi: 10.1017/S1446788700029554
  • R.J. Faudree and R.H. Schelp, Ramsey numbers for all linear forests, Discrete Math. 16 (1976), pp. 149–155. doi: 10.1016/0012-365X(76)90142-4
  • R.J. Faudree and R.H. Schelp, Path Ramsey numbers in multicolorings, J. Comb. Theory Ser. B 19 (1975), pp. 150–160. doi: 10.1016/0095-8956(75)90080-5
  • L. Gerencsér and A. Gyárfás, On Ramsey-type problems, Ann. Univ. Sci. Budapest Eötvös 10 (1967), pp. 167–170.
  • A. Gyárfás, M. Ruszinkó, G.N. Sárközy, and E. Szemerédi, Three-color Ramsey numbers for paths, Combinatorica 27 (2007), pp. 35–69. Corrigendum in 28 (2008) 499–502. doi: 10.1007/s00493-007-0043-4
  • A. Gyárfás, G.N. Sárközy, and S. Selkow, Coverings by few monochromatic pieces: A transition between two Ramsey problems, Graphs Combin. 31(1) (2015), pp. 131–140. doi: 10.1007/s00373-013-1372-2
  • H. Harborth and M. Möller, Weakened Ramsey numbers, Discrete Appl. Math. 95 (1999), pp. 279–284. doi: 10.1016/S0166-218X(99)00081-5
  • A. Khamseh, The (t−1)-colored paths in t-colored complete graphs, Bull. Belg. Math. Soc. Simon Stevin25(2) (2018), pp. 197–207.
  • A. Khamseh and R. Omidi, A generalization of Ramsey theory for linear forests, Int. J. Comput. Math. 89(10) (2012), pp. 1303–1310. doi: 10.1080/00207160.2012.685469
  • A. Khamseh and R. Omidi, A generalization of Ramsey theory for stars and one matching, Math. Rep. 19(69) (2017), pp. 85–92.
  • A. Khamseh and R. Omidi, Large stars with few colors, Math. Rep., to appear.
  • R. Meenakshi and P.S. Sundararaghavan, Generalized Ramsey numbers for paths in 2-chromatic graphs, Internat. J. Math. Sci. 9 (1986), pp. 273–276. doi: 10.1155/S0161171286000339
  • S.P. Radziszowski, Small Ramsey numbers, Electron. J. Combin. 1 (1994). Dynamic Surveys, DS1.15 (March 3, 2017).

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.