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 2024Show all

5 papers · 1 filter

math.CO2024

A note on high-dimensional discrepancy of subtrees

Lawrence Hollom, Lyuben Lichev, Adva Mond +1

For a tree $T$ and a function $f : E (T) \to S^{d}$ , the imbalance of a subtree $T^{'} \subseteq T$ is given by $∣ \sum_{e \in E (T^{'})} f (e) ∣$ . The $d$ -dimensional discrepancy o…

math.CO2024

Discrepancies of spanning trees in dense graphs

Lawrence Hollom, Lyuben Lichev, Adva Mond +1

We address several related problems on combinatorial discrepancy of trees in a setting introduced by Erdős, Füredi, Loebl and Sós. Given a fixed tree $T$ on $n$ vertices and an edg…

math.CO2024

Almost colour-balanced spanning forests in complete graphs

Lawrence Hollom, Adva Mond, Julien Portier

Given $K_{n}$ whose edges are coloured red and blue, and a forest $F$ of order $n$ , we seek embeddings of $F$ with small imbalance, that is, difference between the numbers of red and…

math.PR2024

The Maker-Breaker percolation game on a random board

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

The $(m, b)$ Maker-Breaker percolation game on $(Z^{2})_{p}$ , introduced by Day and Falgas-Ravry, is played in the following way. Before the game starts, each edge of $\mathbb{…

math.CO2024

The asymptotic of off-diagonal online Ramsey numbers for paths

Adva Mond, Julien Portier

We prove that for every $k \geq 10$ , the online Ramsey number for paths $P_{k}$ and $P_{n}$ satisfies $r ~ (P_{k}, P_{n}) \geq \frac{5}{3} n + \frac{k}{9} - 4$ , matching up to a linear te…