Adva Mond

activity

20182025

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

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

collaborators

Showing 2021 · math.COShow all

2 papers · 2 filters

math.CO2021

Counting Hamiltonian Cycles in Dirac Hypergraphs

Asaf Ferber, Liam Hardiman, Adva Mond

For $0 \leq ℓ < k$ , a Hamiltonian $ℓ$ -cycle in a $k$ -uniform hypergraph $H$ is a cyclic ordering of the vertices of $H$ in which the edges are segments of length $k$ and every…

math.CO2021

The Maker-Breaker percolation game on the square lattice

Vojtěch Dvořák, Adva Mond, Victor Souza

We study the $(m, b)$ Maker-Breaker percolation game on $Z^{2}$ , introduced by Day and Falgas-Ravry. As our first result, we show that Breaker has a winning strategy for the…