By Professor Catherine Greenhill

Preprints

Greenhill C; Makai T, 2024, Enumeration of dihypergraphs with specified degrees and edge types, http://arxiv.org/abs/2408.12874v1

Delcourt M; Greenhill C; Isaev M; Lidický B; Postle L, 2023, Decomposing random regular graphs into stars, http://arxiv.org/abs/2308.16037v2

Cooper C; Dyer M; Greenhill C, 2023, A triangle process on graphs with given degree sequence, http://arxiv.org/abs/2301.08499v2

Greenhill C, 2022, Generating graphs randomly, http://arxiv.org/abs/2201.04888v1

Dyer M; Greenhill C; Kleer P; Ross J; Stougie L, 2020, Sampling hypergraphs with given degrees, http://dx.doi.org/10.48550/arxiv.2006.12021

Aldosari HS; Greenhill C, 2019, The average number of spanning hypertrees in sparse uniform hypergraphs, http://dx.doi.org/10.48550/arxiv.1907.04993

Erdős PL; Greenhill C; Mezei TR; Miklós I; Soltész D; Soukup L, 2019, The mixing time of the switch Markov chains: a unified approach, http://dx.doi.org/10.48550/arxiv.1903.06600

Aldosari HS; Greenhill C, 2018, Enumerating sparse uniform hypergraphs with given degree sequence and forbidden edges, http://dx.doi.org/10.48550/arxiv.1805.04991

Altman D; Greenhill C; Isaev M; Ramadurai R, 2016, A threshold result for loose Hamiltonicity in random regular uniform hypergraphs, http://dx.doi.org/10.48550/arxiv.1611.09423

Ayre P; Coja-Oghlan A; Greenhill C, 2015, Hypergraph coloring up to condensation, http://dx.doi.org/10.48550/arxiv.1508.01841

Blinovsky V; Greenhill C, 2014, Asymptotic enumeration of sparse uniform linear hypergraphs with given degrees, http://dx.doi.org/10.48550/arxiv.1409.1314

Blinovsky V; Greenhill C, 2013, Asymptotic enumeration of sparse uniform hypergraphs with given degrees, http://dx.doi.org/10.48550/arxiv.1306.2012

Back to profile page