Michael Molloy

activity

20062022

most citedAsymptotically good edge correspondence colouring

12 citations · 27 across the 15 of their papers we have counts for

collaborators

Showing 2018Show all

3 papers · 1 filter

math.CO2018★ 12 cited

Asymptotically good edge correspondence colouring

Michael Molloy, Luke Postle

We prove that every simple graph with maximum degree $Δ$ has an edge correspondence colouring with $Δ + o (Δ)$ colours.

math.CO2018★ 2 cited

A variant of the Erdos-Renyi random graph process

Adam Logan, Mike Molloy, Pawel Pralat

We consider a natural variant of the Erdős-Rényi random graph process in which $k$ vertices are special and are never put into the same connected component. The model is natural an…

math.CO2018

k-regular subgraphs near the k-core threshold of a random graph

Dieter Mitsche, Michael Molloy, Pawel Pralat

We prove that $G_{n, p = c / n}$ whp has a $k$ -regular subgraph if $c$ is at least $e^{- Θ (k)}$ above the threshold for the appearance of a subgraph with minimum degree at least $k$ ; i.e…