1 citations · 2 across the 5 of their papers we have counts for
5 papers
Lower bounds for online size Ramsey numbers for paths
Natalia Adamska, Grzegorz Adamski
Given two graphs and , an online Ramsey game is played on the edge set of . In every round Builder selects an edge and Painter colors it red or blue. Build…
Creating spanning trees in Waiter-Client games
Grzegorz Adamski, Sylwia Antoniuk, Małgorzata Bednarska-Bzdęga +3
For a positive integer and a tree on vertices, we consider an unbiased Waiter-Client game played on the complete graph~, in which Waiter's g…
Tree universality in positional games
Grzegorz Adamski, Sylwia Antoniuk, Małgorzata Bednarska-Bzdęga +3
In this paper we consider positional games where the winning sets are tree universal graphs. Specifically, we show that in the unbiased Maker-Breaker game on the complete graph $K_…
Online Ramsey numbers: Long versus short cycles
Grzegorz Adamski, Małgorzata Bednarska-Bzdȩga, Václav Blažej
Online Ramsey game is played between Builder and Painter on an infinite board . In every round Builder selects an edge, then Painter colors it red or blue. Both know…
Online size Ramsey numbers: Path vs
Grzegorz Adamski, Małgorzata Bednarska-Bzdęga
Given two graphs and , a size Ramsey game is played on the edge set of . In every round, Builder selects an edge and Painter colours it red or blue. Builder's…