26 citations · 105 across the 26 of their papers we have counts for
40 papers
Jaeger-type orientations of random regular graphs
Catherine Greenhill, Mikhail Isaev, Charles Lewis
We consider -orientations, which are defined to be orientations of -regular graphs such that every vertex either has in-degree or out-degree . These generalise the ori…
Decomposing random regular graphs into stars
Michelle Delcourt, Catherine Greenhill, Mikhail Isaev +2
We study -star decompositions, that is, partitions of the edge set into disjoint stars with edges, in the uniformly random -regular graph model . Using…
Triangle processes on graphs with given degree sequence
Colin Cooper, Martin Dyer, Catherine Greenhill
The switch chain is a well-studied Markov chain which generates random graphs with a given degree sequence and has uniform stationary distribution. Motivated by the high number of…
Generating graphs randomly
Catherine Greenhill
Graphs are used in many disciplines to model the relationships that exist between objects in a complex discrete system. Researchers may wish to compare a network of interest to a "…
Degree sequences of sufficiently dense random uniform hypergraphs
Catherine Greenhill, Mikhail Isaev, Tamás Makai +1
We find an asymptotic enumeration formula for the number of simple -uniform hypergraphs with a given degree sequence, when the number of edges is sufficiently large. The formula…
A triangle process on regular graphs
Colin Cooper, Martin Dyer, Catherine Greenhill
Switches are operations which make local changes to the edges of a graph, usually with the aim of preserving the vertex degrees. We study a restricted set of switches, called trian…