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

5 papers · 1 filter

math.CO2023

Climbing up a random subgraph of the hypercube

Michael Anastos, Sahar Diskin, Dor Elboim +1

Let $Q^{d}$ be the $d$ -dimensional binary hypercube. We say that $P = {v_{1}, \dots, v_{k}}$ is an increasing path of length $k - 1$ in $Q^{d}$ , if for every $i \in [k - 1]$ the edge $v_iv_{i+1…

math.CO2023★ 2 cited

Robust Hamiltonicity in families of Dirac graphs

Michael Anastos, Debsoumya Chakraborti

A graph is called Dirac if its minimum degree is at least half of the number of vertices in it. Joos and Kim showed that every collection $G = {G_{1}, \dots, G_{n}}$ of Dirac g…

math.CO2023

Extremal, enumerative and probabilistic results on ordered hypergraph matchings

Michael Anastos, Zhihan Jin, Matthew Kwan +1

An ordered $r$ -matching is an $r$ -uniform hypergraph matching equipped with an ordering on its vertices. These objects can be viewed as natural generalisations of $r$ -dimensional o…

math.CO2023

Partitioning problems via random processes

Michael Anastos, Oliver Cooley, Mihyun Kang +1

There are a number of well-known problems and conjectures about partitioning graphs to satisfy local constraints. For example, the majority colouring conjecture of Kreutzer, Oum, S…

math.CO2023★ 1 cited

The completion numbers of Hamiltonicity and pancyclicity in random graphs

Yahav Alon, Michael Anastos

Let $μ (G)$ denote the minimum number of edges whose addition to $G$ results in a Hamiltonian graph, and let $μ^(G)$ denote the minimum number of edges whose addition to $G$ resu…