T. Johansson

most citedA condition for Hamiltonicity in Sparse Random Graphs with a Fixed Degree Sequence

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

collaborators

5 papers

math.CO2020

Hamilton cycles in weighted Erdős-Rényi graphs

Tony Johansson

Given a symmetric $n \times n$ matrix $P$ with $0 \leq P (u, v) \leq 1$ , we define a random graph $G_{n, P}$ on $[n]$ by independently including any edge ${u, v}$ with probability $P(…

math.CO2020★ 1 cited

A condition for Hamiltonicity in Sparse Random Graphs with a Fixed Degree Sequence

Tony Johansson

We consider the random graph $G_{n, d}$ chosen uniformly at random from the set of all graphs with a given sparse degree sequence $d$ . We assume $d$ has minimum d…

math.CO2018

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,…