2 papers
math.CO2008
Fast winning strategies in Avoider-Enforcer games
Dan Hefetz, Michael Krivelevich, Miloš Stojaković +1
In numerous positional games the identity of the winner is easily determined. In this case one of the more interesting questions is not {\em who} wins but rather {\em how fast} can…
math.CO2006
Hamilton cycles in highly connected and expanding graphs
Dan Hefetz, Michael Krivelevich, Tibor Szabo
In this paper we prove a sufficient condition for the existence of a Hamilton cycle, which is applicable to a wide variety of graphs, including relatively sparse graphs. In contras…