Vojtvech Dvovr'ak

activity

20202022

collaborators

4 papers

math.CO2022

Waiter-Client Clique-Factor Game

Vojtěch Dvořák

Fix two integers $n, k$ , with $n$ divisible by $k$ , and consider the following game played by two players, Waiter and Client, on the edges of $K_{n}$ . Starting with all the edges mar…

math.CO2021

Waiter-Client Triangle-Factor Game on the Edges of the Complete Graph

Vojtěch Dvořák

Consider the following game played by two players, called Waiter and Client, on the edges of $K_{n}$ (where $n$ is divisible by $3$ ). Initially, all the edges are unclaimed. In each…

math.CO2020

A Note on Restricted Online Ramsey Numbers of Matchings

Vojtěch Dvořák

The restricted online Ramsey numbers were introduced by Conlon, Fox, Grinshpun and He in 2019. In a recent paper, Briggs and Cox studied the restricted online Ramsey numbers of mat…

math.CO2020

$P_{n}$ -induced-saturated graphs exist for all $n \geq 6$

Vojtěch Dvořák

Let $P_{n}$ be a path graph on $n$ vertices. We say that a graph $G$ is $P_{n}$ -induced-saturated if $G$ contains no induced copy of $P_{n}$ , but deleting any edge of $G$ as well a…

Waiter-Client Clique-Factor Game

Waiter-Client Triangle-Factor Game on the Edges of the Complete Graph

A Note on Restricted Online Ramsey Numbers of Matchings

Pn​-induced-saturated graphs exist for all n≥6

$P_{n}$ -induced-saturated graphs exist for all $n \geq 6$