35 citations · 69 across the 35 of their papers we have counts for
7 papers · 1 filter
Waiter-Client and Client-Waiter planarity, colorability and minor games
Dan Hefetz, Michael Krivelevich, Wei En Tan
For a finite set , a family of sets and a positive integer , we consider two types of two player, perfect information games with no chance moves.…
Manipulative waiters with probabilistic intuition
Mał gorzata Bednarska-Bzdȩga, Dan Hefetz, Michael Krivelevich +1
For positive integers and 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…
On saturation games
Dan Hefetz, Michael Krivelevich, Alon Naor +1
A graph is said to be saturated with respect to a monotone increasing graph property , if but for…
Random directed graphs are robustly Hamiltonian
Dan Hefetz, Angelika Steger, Benny Sudakov
A classical theorem of Ghouila-Houri from 1960 asserts that every directed graph on vertices with minimum out-degree and in-degree at least contains a directed Hamilton c…
Positional Games
Michael Krivelevich
Positional games are a branch of combinatorics, researching a variety of two-player games, ranging from popular recreational games such as Tic-Tac-Toe and Hex, to purely abstract g…
Picker-Chooser fixed graph games
Małgorzata Bednarska-Bzdȩga, Dan Hefetz, Tomasz Łuczak
Given a fixed graph and a positive integer , a Picker-Chooser -game is a biased game played on the edge set of in which Picker is trying to force many copies of …