Małgorzata Bednarska-Bzdȩga

activity

20112024

most citedTrapping a particle of a quantum walk on the line

85 citations · 90 across the 10 of their papers we have counts for

collaborators

11 papers

math.CO2024

Creating spanning trees in Waiter-Client games

Grzegorz Adamski, Sylwia Antoniuk, Małgorzata Bednarska-Bzdęga +3

For a positive integer $n$ and a tree $T_{n}$ on $n$ vertices, we consider an unbiased Waiter-Client game $WC (n, T_{n})$ played on the complete graph~ $K_{n}$ , in which Waiter's g…

math.CO2023

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_…

math.CO2023

Off-diagonal online size Ramsey numbers for paths

Małgorzata Bednarska-Bzdȩga

Consider the following Ramsey game played on the edge set of $K_{N}$ . In every round, Builder selects an edge and Painter colours it red or blue. Builder's goal is to force…

math.CO2023★ 1 cited

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 $K_{N}$ . In every round Builder selects an edge, then Painter colors it red or blue. Both know…

math.CO2022★ 1 cited

Online size Ramsey numbers: Path vs $C_{4}$

Grzegorz Adamski, Małgorzata Bednarska-Bzdęga

Given two graphs $G$ and $H$ , a size Ramsey game is played on the edge set of $K_{N}$ . In every round, Builder selects an edge and Painter colours it red or blue. Builder's…

math.CO2021

Online size Ramsey numbers: Odd cycles vs connected graphs

Grzegorz Adamski, Małgorzata Bednarska-Bzdęga

Given two graph families $H_{1}$ and $H_{2}$ , a size Ramsey game is played on the edge set of $K_{N}$ . In every round, Builder selects an edge and Painter colo…

math.CO2017★ 1 cited

On the separation conjecture in Avoider-Enforcer games

Małgorzata Bednarska-Bzdȩga, Omri Ben-Eliezer, Lior Gishboliner +1

Given a fixed graph $H$ with at least two edges and positive integers $n$ and $b$ , the strict $(1 : b)$ Avoider-Enforcer $H$ -game, played on the edge set of $K_{n}$ , has the fol…

math.CO2016

Proper colouring Painter-Builder game

Małgorzata Bednarska-Bzdęga, Michael Krivelevich, Viola Mészáros +1

We consider the following two-player game, parametrised by positive integers $n$ and $k$ . The game is played between Painter and Builder, alternately taking turns, with Painter mov…

math.CO2014

Manipulative waiters with probabilistic intuition

Mał gorzata Bednarska-Bzdȩga, Dan Hefetz, Michael Krivelevich +1

For positive integers $n$ and $q$ and a monotone graph property $\cA$, we consider the two player, perfect information game $\WC(n,q,\cA)$, which is defined as follows. The game pr…

math.CO2014★ 2 cited

Picker-Chooser fixed graph games

Małgorzata Bednarska-Bzdȩga, Dan Hefetz, Tomasz Łuczak

Given a fixed graph $H$ and a positive integer $n$ , a Picker-Chooser $H$ -game is a biased game played on the edge set of $K_{n}$ in which Picker is trying to force many copies of $H$ …

quant-ph2011★ 85 cited

Trapping a particle of a quantum walk on the line

Antoni Wojcik, Tomasz Luczak, Pawel Kurzynski +3

We observe that changing a phase at a single point in a discrete quantum walk results in a rather surprising localization effect. For certain values of this phase change the possib…