Michael Anastos

Available identifiers

zbMath Open anastos.michaelMaRDI QIDQ1753046

List of research outcomes

Publication	Date of Publication	Type
Partitioning problems via random processes	2025-01-08	Paper
Climbing up a random subgraph of the hypercube	2024-12-20	Paper
On the chromatic number of powers of subdivisions of graphs	2024-12-04	Paper
Climbing up a random subgraph of the hypercube	2023-11-28	Paper
A scaling limit for the length of the longest cycle in a sparse random digraph	2023-10-12	Paper
Finding maximum matchings in random regular graphs in linear expected time	2023-10-11	Paper
Robust Hamiltonicity in families of Dirac graphs	2023-09-21	Paper
Extremal, enumerative and probabilistic results on ordered hypergraph matchings	2023-08-23	Paper
Splitting matchings and the Ryser-Brualdi-Stein conjecture for multisets	2023-08-18	Paper
Partitioning problems via random processes	2023-07-12	Paper
A note on long cycles in sparse random graphs	2023-05-16	Paper
The completion numbers of Hamiltonicity and pancyclicity in random graphs	2023-04-07	Paper
On a Connectivity Threshold for Colorings of Random Graphs and Hypergraphs	2023-02-03	Paper
https://portal.mardi4nfdi.de/entity/Q5875526	2023-02-03	Paper
Constructing Hamilton cycles and perfect matchings efficiently	2022-09-20	Paper
An improved lower bound on the length of the longest cycle in random graphs	2022-08-14	Paper
Fast algorithms for solving the Hamilton Cycle problem with high probability	2021-11-29	Paper
A fast algorithm on average for solving the Hamilton Cycle problem	2021-11-29	Paper
Hamiltonicity of Random Graphs in the Stochastic Block Model	2021-08-20	Paper
On a k-matching algorithm and finding k-factors in random graphs with minimum degree k+1 in linear time	2021-07-07	Paper
Packing Hamilton Cycles in Cores of Random Graphs	2021-07-07	Paper
A scaling limit for the length of the longest cycle in a sparse random graph	2021-03-08	Paper
Hamilton cycles in random graphs with minimum degree at least 3: An improved analysis	2021-01-05	Paper
On the connectivity of proper colorings of random graphs and hypergraphs	2020-10-26	Paper
How many randomly colored edges make a randomly colored dense graph rainbow Hamiltonian or rainbow connected?	2020-07-17	Paper
A Ramsey property of random regular and k‐out graphs	2020-05-21	Paper
Thresholds in random motif graphs	2019-07-28	Paper
Pattern Colored Hamilton Cycles in Random Graphs	2019-03-20	Paper
Finding perfect matchings in random regular graphs in linear time	2018-11-27	Paper
Connectivity of the k-Out Hypercube	2018-09-05	Paper
Packing Directed Hamilton Cycles Online	2018-07-18	Paper
Constraining the clustering transition for colorings of sparse random graphs	2018-05-25	Paper
On the connectivity threshold for colorings of random graphs and hypergraphs	2018-03-14	Paper
Randomly coloring simple hypergraphs with fewer colors	2017-06-30	Paper
On the chromatic number of powers of subdivisions of graphs	N/A	Paper

Research outcomes over time

This page was built for person: Michael Anastos