12 citations · 27 across the 15 of their papers we have counts for
18 papers
The degree-restricted random process is far from uniform
Michael Molloy, Erlang Surya, Lutz Warnke
The degree-restricted random process is a natural algorithmic model for generating graphs with degree sequence D_n=(d_1, \ldots, d_n): starting with an empty n-vertex graph, it seq…
Adaptable and conflict colouring multigraphs with no cycles of length three or four
Jurgen Aliaj, Michael Molloy
The adaptable choosability of a multigraph , denoted , is the smallest integer such that any edge labelling, , of and any assignment of lists of siz…
Fractional cocoloring of graphs
John Gimbel, André Kündgen, Michael Molloy
The cochromatic number of a graph is the fewest number of colors needed to color the vertices of so that each color class is a clique or an independent set. In a fra…
Asymptotically good edge correspondence colouring
Michael Molloy, Luke Postle
We prove that every simple graph with maximum degree has an edge correspondence colouring with colours.
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 vertices are special and are never put into the same connected component. The model is natural an…
k-regular subgraphs near the k-core threshold of a random graph
Dieter Mitsche, Michael Molloy, Pawel Pralat
We prove that whp has a -regular subgraph if is at least above the threshold for the appearance of a subgraph with minimum degree at least ; i.e…