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

5 papers · 1 filter

math.CO2017

Pattern Colored Hamilton Cycles in Random Graphs

Michael Anastos, Alan Frieze

We consider the existence of patterned Hamilton cycles in randomly colored random graphs. Given a string $Π$ over a set of colors ${1, 2, \dots, r}$ , we say that a Hamilton cycle i…

math.CO2017

A Ramsey Property of Random Regular and $k$ -out Graphs

Michael Anastos, Deepak Bal

In this note we consider a Ramsey property of random $d$ -regular graphs, $G (n, d)$ . Let $r \geq 2$ be fixed. Then w.h.p. the edges of $G (n, 2 r)$ can be colored suc…

math.CO2017

Connectivity of the k-out Hypercube

Michael Anastos

In this paper we study the connectivity properties of the random subgraph of the $n$ -cube generated by the $k$ -out model and denoted by $Q^{n} (k)$ . Let $k$ be an integer, $1\leq k \l…

math.CO2017

Constraining the clustering transition for colorings of sparse random graphs

Michael Anastos, Alan Frieze, Wesley Pegden

Let $Ω_{q}$ denote the set of proper $q$ -colorings of the random graph $G_{n, m}, m = d n /2$ and let $H_{q}$ be the graph with vertex set $Ω_{q}$ and an edge ${σ, τ}$ where $σ, τ$ are mappin…

cs.DM2017

Randomly coloring simple hypergraphs with fewer colors

Michael Anastos, Alan Frieze

We study the problem of constructing a (near) uniform random proper $q$ -coloring of a simple $k$ -uniform hypergraph with $n$ vertices and maximum degree $Δ$ . (Proper in that no edg…

Pattern Colored Hamilton Cycles in Random Graphs

A Ramsey Property of Random Regular and k-out Graphs

Connectivity of the k-out Hypercube

Constraining the clustering transition for colorings of sparse random graphs

Randomly coloring simple hypergraphs with fewer colors

A Ramsey Property of Random Regular and $k$ -out Graphs