1. Asymptotic enumeration of sparse uniform hypergraphs with given degrees. (January 2016) Authors: Blinovsky, Vladimir; Greenhill, Catherine Journal: European journal of combinatorics Issue: Volume 51(2016:Jan.) Page Start: 287 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
2. Asymptotic enumeration of sparse uniform hypergraphs with given degrees. (January 2016) Authors: Blinovsky, Vladimir; Greenhill, Catherine Journal: European journal of combinatorics Issue: Volume 51(2016:Jan.) Page Start: 287 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
3. Counting independent sets in graphs with bounded bipartite pathwidth. Issue 2 (10th March 2021) Authors: Dyer, Martin; Greenhill, Catherine; Müller, Haiko Journal: Random structures & algorithms Issue: Volume 59:Issue 2(2021) Page Start: 204 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
4. Criminal network vulnerabilities and adaptations. Issue 4 (2nd October 2017) Authors: Bright, David; Greenhill, Catherine; Britz, Thomas; Ritter, Alison; Morselli, Carlo Journal: Global crime Issue: Volume 18:Issue 4(2017) Page Start: 424 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
5. Enumerating sparse uniform hypergraphs with given degree sequence and forbidden edges. (March 2019) Authors: Aldosari, Haya S.; Greenhill, Catherine Journal: European journal of combinatorics Issue: Volume 77(2019) Page Start: 68 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
6. Hypergraph coloring up to condensation. Issue 4 (12th December 2018) Authors: Ayre, Peter; Coja‐Oghlan, Amin; Greenhill, Catherine Journal: Random structures & algorithms Issue: Volume 54:Issue 4(2019) Page Start: 615 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
7. Mixing of the Glauber dynamics for the ferromagnetic Potts model1. Issue 1 (4th September 2014) Authors: Bordewich, Magnus; Greenhill, Catherine; Patel, Viresh Journal: Random structures & algorithms Issue: Volume 48:Issue 1(2016) Page Start: 21 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
8. Spanning trees in random regular uniform hypergraphs. (26th January 2022) Authors: Greenhill, Catherine; Isaev, Mikhail; Liang, Gary Journal: Combinatorics, probability and computing Issue: Volume 31:Number 1(2022) Page Start: 29 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
9. Subgraph counts for dense random graphs with specified degrees. (5th May 2021) Authors: Greenhill, Catherine; Isaev, Mikhail; McKay, Brendan D. Journal: Combinatorics, probability and computing Issue: Volume 30:Number 3(2021) Page Start: 460 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
10. The average number of spanning trees in sparse graphs with given degrees. (June 2017) Authors: Greenhill, Catherine; Isaev, Mikhail; Kwan, Matthew; McKay, Brendan D. Journal: European journal of combinatorics Issue: Volume 63(2017) Page Start: 6 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗