Search
Abstract
We consider on-line Ramsey numbers defined by a game played between two players, Builder and Painter. In each round Builder draws an the edge and Painter colors it either red or blue, as it appears. Builder’s goal is to force Painter to create a monochromatic copy of a fixed graph H in as few rounds as possible. The minimum number of rounds (assuming both players play perfectly) is the on-line Ramsey number \widetilde{r}(H) of the graph H. An asymmetric version of the on-line Ramsey numbers \widetilde{r}(G,H) is defined accordingly. In 2005, Kurek and Ruciński computed \widetilde{r}(C3). In this paper, we compute \widetilde{r}(C4,Ck) for 3≤k≤7. Most of the results are based on computer algorithms but we obtain the exact value \widetilde{r}(C4) and do so without the help of computer algorithms.
Authors (2)
-
Tomasz Dzido
- Wydział Matematyki, Fizyki i Informatyki UG Instytut Informatyki
Cite as
Full text
- Publication version
- Accepted or Published Version
- License
-
open in new tab
Keywords
Details
- Category:
- Articles
- Type:
- artykuły w czasopismach recenzowanych i innych wydawnictwach ciągłych
- Published in:
-
Opuscula Mathematica
no. 34,
pages 463 - 468,
ISSN: 1232-9274 - Language:
- English
- Publication year:
- 2014
- Bibliographic description:
- Cyman J., Dzido T.: A NOTE ON ON-LINE RAMSEY NUMBERS FOR QUADRILATERALS// Opuscula Mathematica. -Vol. 34., iss. 3 (2014), s.463-468
- Verified by:
- Gdańsk University of Technology
seen 118 times
Recommended for you
On some Zarankiewicz numbers and bipartite Ramsey Numbers for Quadrilateral
- J. Dybizbański,
- T. Dzido,
- S. Radziszowski