A note on on-line Ramsey numbers of stars and paths
Document Type
Article
Publication Date
9-1-2021
Abstract
An on-line Ramsey game is a game between two players, Builder and Painter, on an initially empty graph with unbounded set of vertices. In each round, Builder selects two vertices and joins them with an edge while Painter colours the edge immediately with either red or blue. Builder's aim is to force either a red copy of a fixed graph G or a blue copy of a fixed graph H. The game ends with Builder's victory when Builder manages to force either a red G or a blue H. The minimum number of rounds for Builder to win the game, regardless of Painter's strategy, is the on-line Ramsey number r (G, H). This note focuses on the case when G and H are stars and paths. In particular, we will prove the upper bound of r (S-3, Pl+1) <= 5l/3 + 2. We will also present an alternative proof for the upper bound of r (S-2 = P-3, Pl+1) = 5l/4].
Keywords
Ramsey theory, On-line Ramsey game, Stars, Paths
Divisions
MathematicalSciences
Funders
Faculty of Science-University of Malaya Research Grant (RF017B-2018)
Publication Title
Bulletin of the Malaysian Mathematical Sciences Society
Volume
44
Issue
5
Publisher
Malaysian Mathematical Sciences Soc
Publisher Location
CAMPUS, 4 CRINAN ST, LONDON, N1 9XW, ENGLAND