Michael Anastos

activity

20162025

most citedHamiltonicity of random graphs in the stochastic block model

3 citations · 11 across the 32 of their papers we have counts for

collaborators

Showing 2022 · math.COShow all

3 papers · 2 filters

math.CO2022

Splitting matchings and the Ryser-Brualdi-Stein conjecture for multisets

Michael Anastos, David Fabian, Alp Müyesser +1

We study multigraphs whose edge-sets are the union of three perfect matchings, $M_{1}$ , $M_{2}$ , and $M_{3}$ . Given such a graph $G$ and any $a_{1}, a_{2}, a_{3} \in N$ with $a_1+a_2+a_3…

math.CO2022

Constructing Hamilton cycles and perfect matchings efficiently

Michael Anastos

Let $ε > 0$ . We consider the problem of constructing a Hamiltonian graph with $(1 + ε) n$ edges in the following controlled random graph process. Starting with the empty graph on $[n]$ ,…

math.CO2022★ 1 cited

An improved lower bound on the length of the longest cycle in random graphs

Michael Anastos

We provide a new lower bound on the length of the longest cycle of the binomial random graph $G (n, (1 + ε) / n)$ that holds w.h.p. for all $ε = ε (n)$ such that $ε^{3} n \to \infty$ . In the ca…