Adva Mond

activity

20182025

most citedMinimum degree edge-disjoint Hamilton cycles in random directed graphs

1 citations · 1 across the 13 of their papers we have counts for

collaborators

Showing 2019Show all

3 papers · 1 filter

math.CO2019

Turán-type problems for long cycles in random and pseudo-random graphs

Michael Krivelevich, Gal Kronenberg, Adva Mond

We study the Turán number of long cycles in random graphs and in pseudo-random graphs. Denote by $e x (G (n, p), H)$ the random variable counting the number of edges in a largest subgra…

math.CO2019

On the Odd Cycle Game and Connected Rules

Jan Corsten, Adva Mond, Alexey Pokrovskiy +2

We study the positional game where two players, Maker and Breaker, alternately select respectively $1$ and $b$ previously unclaimed edges of $K_{n}$ . Maker wins if she succeeds in cl…

math.CO2019

$H$ -games played on vertex sets of random graphs

Gal Kronenberg, Adva Mond, Alon Naor

We introduce a new type of positional games, played on a vertex set of a graph. Given a graph $G$ , two players claim vertices of $G$ , where the outcome of the game is determined by…

Turán-type problems for long cycles in random and pseudo-random graphs

On the Odd Cycle Game and Connected Rules

H-games played on vertex sets of random graphs

$H$ -games played on vertex sets of random graphs