T. Johansson

activity

20142020

most citedInversions in split trees and conditional Galton--Watson trees

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

collaborators

Showing 2018Show all

3 papers · 1 filter

math.CO2018★ 1 cited

On Hamilton cycles in Erdős-Rényi subgraphs of large graphs

Tony Johansson

Given a graph $Γ = (V, E)$ on $n$ vertices and $m$ edges, we define the Erdős-Rényi graph process with host $Γ$ as follows. A permutation $e_{1}, \dots, e_{m}$ of $E$ is chosen uniformly…

math.CO2018

The cover time of a biased random walk on a random regular graph of odd degree

Tony Johansson

We consider a random walk process which prefers to visit previously unvisited edges, on the random $r$ -regular graph $G_{r}$ for any odd $r \geq 3$ . We show that this random walk proc…

math.CO2018

The cover time of a biased random walk on a random cubic graph

Colin Cooper, Alan Frieze, Tony Johansson

We study a random walk that prefers tou se unvisited edges in the context of random cubic graphs. We establish asymptotically correct estimates for the vertex and edge cover times,…