3 citations · 11 across the 32 of their papers we have counts for
5 papers · 2 filters
Majority Colorings of Sparse Digraphs
Michael Anastos, Ander Lamaison, Raphael Steiner +1
A majority coloring of a directed graph is a vertex-coloring in which every vertex has the same color as at most half of its out-neighbors. Kreutzer, Oum, Seymour, van der Zypen an…
Hamiltonicity of random graphs in the stochastic block model
Michael Anastos, Alan Frieze, Pu Gao
We study the Hamiltonicity of the following model of a random graph. Suppose that we partition [n] into V_1,V_2,...,V_k and add edge {x,y} to our graph with probability p if there…
Thresholds in random motif graphs
Michael Anastos, Peleg Michaeli, Samantha Petti
We introduce a natural generalization of the Erdős-Rényi random graph model in which random instances of a fixed motif are added independently. The binomial random motif graph $G(H…
A scaling limit for the length of the longest cycle in a sparse random graph
Michael Anastos, Alan Frieze
We discuss the length of the longest cycle in a sparse random graph . constant. We show that for large there is a function such that $L_n(c)/n\to f(c)…
Hamilton cycles in random graphs with minimum degree at least 3: an improved analysis
Michael Anastos, Alan Frieze
In this paper we consider the existence of Hamilton cycles in the random graph . This a random graph chosen uniformly from the set of graphs with vertex set $[…