Yahav Alon

activity

20182023

most citedThe completion numbers of Hamiltonicity and pancyclicity in random graphs

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

collaborators

Showing 2022Show all

2 papers · 1 filter

math.CO2022

Hamilton completion and the path cover number of sparse random graphs

Yahav Alon, Michael Krivelevich

We prove that for every $ε > 0$ there is $c_{0}$ such that if $G \sim G (n, c / n)$ , $c \geq c_{0}$ , then with high probability $G$ can be covered by at most $(1+\varepsilon)\cdot \…

math.CO2022

The global resilience of Hamiltonicity in $G (n, p)$

Yahav Alon

Denote by $r_{g} (G, H)$ the global resilience of a graph $G$ with respect to Hamiltonicity. That is, $r_{g} (G, H)$ is the minimal $r$ for which there exists a subgrap…

Hamilton completion and the path cover number of sparse random graphs

The global resilience of Hamiltonicity in G(n,p)

The global resilience of Hamiltonicity in $G (n, p)$