2 citations · 2 across the 4 of their papers we have counts for
5 papers
Building spanning trees quickly in Maker-Breaker games
Dennis Clemens, Asaf Ferber, Roman Glebov +2
For a tree T on n vertices, we study the Maker-Breaker game, played on the edge set of the complete graph on n vertices, which Maker wins as soon as the graph she builds contains a…
How many colors guarantee a rainbow matching?
Roman Glebov, Benny Sudakov, Tibor Szabó
Given a coloring of the edges of a multi-hypergraph, a rainbow t-matching is a collection of t disjoint edges, each having a different color. In this note we study the problem of f…
Biased Games On Random Boards
Asaf Ferber, Roman Glebov, Michael Krivelevich +1
In this paper we analyze biased Maker-Breaker games and Avoider-Enforcer games, both played on the edge set of a random board $G\sim \gnp$. In Maker-Breaker games there are two pla…
The biased odd cycle game
Asaf Ferber, Roman Glebov, Michael Krivelevich +4
In this paper we consider biased Maker-Breaker games played on the edge set of a given graph . We prove that for every and large enough , there exists a constant fo…
On the number of Hamilton cycles in sparse random graphs
R. Glebov, M. Krivelevich
We prove that the number of Hamilton cycles in the random graph G(n,p) is n!p^n(1+o(1))^n a.a.s., provided that p\geq (ln n+ln ln n+ω(1))/n. Furthermore, we prove the hitting-time…