On-line Ramsey numbers for paths and short cycles
Janusz Dybizbański , Tomasz Dzido , Renata Zakrzewska
AbstractConsider a game played on the edge set of the infinite clique by two players, Builder and Painter. In each round, Builder chooses an edge and Painter colors it red or blue. Builder wins by creating either a red copy of or a blue copy of for some fixed graphs and . The minimum number of rounds within which Builder can win, assuming both players play perfectly, is the on-line Ramsey number r(G,H). In this paper, we prove some new general lower and upper bounds for on-line Ramsey numbers r(C3,Pk) and r(C4,Pk).
|Journal series||Discrete Applied Mathematics, ISSN 0166-218X, e-ISSN 1872-6771, (N/A 70 pkt)|
|Publication size in sheets||0.50|
|Keywords in English||on-line Ramsey theory, combinatorial games, paths cycles|
|License||Journal (articles only); published final; ; with publication|
|Score||= 70.0, 13-03-2020, ArticleFromJournal|
|Publication indicators||: 2018 = 1.263; : 2018 = 0.983 (2) - 2018=1.029 (5)|
* presented citation count is obtained through Internet information analysis and it is close to the number calculated by the Publish or Perish system.