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

2 papers · 1 filter

math.CO2024

A note on finding large transversals efficiently

Michael Anastos, Patrick Morris

In an array filled with symbols, a transversal is a collection of entries with distinct rows, columns and symbols. In this note we show that if no symbol appears more…

math.CO2024

On the chromatic number of powers of subdivisions of graphs

Michael Anastos, Simona Boyadzhiyska, Silas Rathke +1

For a given graph , we define its \emph{th subdivision} as the graph obtained from by replacing every edge by a path of length . We also define the \emph{th p…