Follow
Michael Anastos
Title
Cited by
Cited by
Year
A scaling limit for the length of the longest cycle in a sparse random graph
M Anastos, A Frieze
Journal of Combinatorial Theory, Series B 148, 184-208, 2021
132021
Majority colorings of sparse digraphs
M Anastos, A Lamaison, R Steiner, T Szabó
arXiv preprint arXiv:1911.01954, 2019
132019
Robust Hamiltonicity in families of Dirac graphs
M Anastos, D Chakraborti
arXiv preprint arXiv:2309.12607, 2023
122023
How many randomly colored edges make a randomly colored dense graph rainbow Hamiltonian or rainbow connected?
M Anastos, A Frieze
Journal of Graph Theory 92 (4), 405-414, 2019
122019
Pattern colored Hamilton cycles in random graphs
M Anastos, A Frieze
SIAM Journal on Discrete Mathematics 33 (1), 528-545, 2019
102019
Hamilton cycles in random graphs with minimum degree at least 3: An improved analysis
M Anastos, A Frieze
Random Structures & Algorithms 57 (4), 865-878, 2020
92020
Randomly coloring simple hypergraphs with fewer colors
A Frieze, M Anastos
Information Processing Letters 126, 39-42, 2017
82017
A scaling limit for the length of the longest cycle in a sparse random digraph
M Anastos, A Frieze
Random Structures & Algorithms 60 (1), 3-24, 2022
72022
Finding perfect matchings in random cubic graphs in linear time
M Anastos, A Frieze
arXiv preprint arXiv:1808.00825, 2018
52018
Constraining the clustering transition for colorings of sparse random graphs
M Anastos, A Frieze, W Pegden
arXiv preprint arXiv:1705.07944, 2017
52017
Hamiltonicity of random graphs in the stochastic block model
M Anastos, A Frieze, P Gao
SIAM Journal on Discrete Mathematics 35 (3), 1854-1880, 2021
42021
Partitioning problems via random processes
M Anastos, O Cooley, M Kang, M Kwan
Journal of the London Mathematical Society 110 (6), e70010, 2024
32024
Extremal, enumerative and probabilistic results on ordered hypergraph matchings
M Anastos, Z Jin, M Kwan, B Sudakov
arXiv preprint arXiv:2308.12268, 2023
32023
Constructing Hamilton cycles and perfect matchings efficiently
M Anastos
arXiv preprint arXiv:2209.09860, 2022
32022
A note on long cycles in sparse random graphs
M Anastos
arXiv preprint arXiv:2105.13828, 2021
32021
Finding maximum matchings in random regular graphs in linear expected time
M Anastos, A Frieze
Random Structures & Algorithms 58 (3), 390-429, 2021
32021
Thresholds in random motif graphs
M Anastos, P Michaeli, S Petti
arXiv preprint arXiv:1907.12043, 2019
32019
Splitting matchings and the Ryser-Brualdi-Stein conjecture for multisets
M Anastos, D Fabian, A Müyesser, T Szabó
arXiv preprint arXiv:2212.03100, 2022
22022
On the connectivity of proper colorings of random graphs and hypergraphs
M Anastos, A Frieze
Random Structures & Algorithms 56 (4), 988-997, 2020
22020
A Ramsey property of random regular and k‐out graphs
M Anastos, D Bal
Journal of Graph Theory 93 (3), 363-371, 2020
22020
The system can't perform the operation now. Try again later.
Articles 1–20