Log In Sign Up

On Induced Online Ramsey Number of Paths, Cycles, and Trees

by   Václav Blažej, et al.

An online Ramsey game is a game between Builder and Painter, alternating in turns. They are given a graph H and a graph G of an infinite set of independent vertices. In each round Builder draws an edge and Painter colors it either red or blue. Builder wins if after some finite round there is a monochromatic copy of the graph H, otherwise Painter wins. The online Ramsey number r(H) is the minimum number of rounds such that Builder can force a monochromatic copy of H in G. This is an analogy to the size-Ramsey number r(H) defined as the minimum number such that there exists graph G with r(H) edges where for any edge two-coloring G contains a monochromatic copy of H. In this paper, we introduce the concept of induced online Ramsey numbers: the induced online Ramsey number r_ind(H) is the minimum number of rounds Builder can force an induced monochromatic copy of H in G. We prove asymptotically tight bounds on the induced online Ramsey numbers of paths, cycles and two families of trees. Moreover, we provide a result analogous to Conlon [On-line Ramsey Numbers, SIAM J. Discr. Math. 2009], showing that there is an infinite family of trees T_1,T_2,..., |T_i|<|T_i+1| for i>1, such that _i→∞r(T_i)/r(T_i) = 0.


page 1

page 2

page 3

page 4


On off-diagonal ordered Ramsey numbers of nested matchings

For two graphs G^< and H^< with linearly ordered vertex sets, the ordere...

Induced universal graphs for families of small graphs

We present exact and heuristic algorithms that find, for a given family ...

On the Graceful Game

A graceful labeling of a graph G with m edges consists of labeling the v...

Rainbow cycles for families of matchings

Given a graph G and a coloring of its edges, a subgraph of G is called r...

Graph pattern detection: Hardness for all induced patterns and faster non-induced cycles

We consider the pattern detection problem in graphs: given a constant si...

Infinite Wordle and the Mastermind numbers

I consider the natural infinitary variations of the games Wordle and Mas...

On the Descriptive Complexity of Groups without Abelian Normal Subgroups

In this paper, we explore the descriptive complexity theory of finite gr...