The following pages link to Michael Anastos (Q1753046):
Displayed 31 items.
- Constraining the clustering transition for colorings of sparse random graphs (Q1753047) (← links)
- A scaling limit for the length of the longest cycle in a sparse random graph (Q1998764) (← links)
- Randomly coloring simple hypergraphs with fewer colors (Q2361498) (← links)
- Pattern Colored Hamilton Cycles in Random Graphs (Q3122311) (← links)
- Packing Directed Hamilton Cycles Online (Q3174695) (← links)
- How many randomly colored edges make a randomly colored dense graph rainbow Hamiltonian or rainbow connected? (Q3299214) (← links)
- Hamilton cycles in random graphs with minimum degree at least 3: An improved analysis (Q3386518) (← links)
- Connectivity of the k-Out Hypercube (Q4584954) (← links)
- Hamiltonicity of Random Graphs in the Stochastic Block Model (Q5009335) (← links)
- A Ramsey property of random regular and k‐out graphs (Q5110662) (← links)
- On the connectivity of proper colorings of random graphs and hypergraphs (Q5128749) (← links)
- On a Connectivity Threshold for Colorings of Random Graphs and Hypergraphs (Q5875492) (← links)
- (Q5875526) (← links)
- A note on long cycles in sparse random graphs (Q6042104) (← links)
- Finding maximum matchings in random regular graphs in linear expected time (Q6049997) (← links)
- A scaling limit for the length of the longest cycle in a sparse random digraph (Q6074672) (← links)
- Splitting matchings and the Ryser-Brualdi-Stein conjecture for multisets (Q6133146) (← links)
- On the connectivity threshold for colorings of random graphs and hypergraphs (Q6299044) (← links)
- Finding perfect matchings in random regular graphs in linear time (Q6310298) (← links)
- Thresholds in random motif graphs (Q6322794) (← links)
- On a k-matching algorithm and finding k-factors in random graphs with minimum degree k+1 in linear time (Q6372259) (← links)
- Packing Hamilton Cycles in Cores of Random Graphs (Q6372261) (← links)
- Fast algorithms for solving the Hamilton Cycle problem with high probability (Q6384264) (← links)
- A fast algorithm on average for solving the Hamilton Cycle problem (Q6384267) (← links)
- An improved lower bound on the length of the longest cycle in random graphs (Q6407818) (← links)
- Constructing Hamilton cycles and perfect matchings efficiently (Q6411392) (← links)
- The completion numbers of Hamiltonicity and pancyclicity in random graphs (Q6432439) (← links)
- Partitioning problems via random processes (Q6443559) (← links)
- Extremal, enumerative and probabilistic results on ordered hypergraph matchings (Q6448409) (← links)
- Robust Hamiltonicity in families of Dirac graphs (Q6452175) (← links)
- Climbing up a random subgraph of the hypercube (Q6461085) (← links)