Catherine Greenhill

From MaRDI portal
Person:311512

Available identifiers

zbMath Open greenhill.catherine-sMaRDI QIDQ311512

List of research outcomes

PublicationDate of PublicationType
https://portal.mardi4nfdi.de/entity/Q60843542023-10-31Paper
Counting independent sets in graphs with bounded bipartite pathwidth2023-10-12Paper
Balanced allocation on hypergraphs2023-08-21Paper
Degree sequences of sufficiently dense random uniform hypergraphs2023-04-03Paper
Spanning trees in random regular uniform hypergraphs2023-03-31Paper
Lower bounds on the chromatic number of random graphs2023-01-23Paper
Generating graphs randomly2022-11-18Paper
A triangle process on regular graphs2022-03-22Paper
The mixing time of switch Markov chains: a unified approach2021-10-28Paper
Subgraph counts for dense random graphs with specified degrees2021-06-15Paper
Mixing time of the switch Markov chain and stable degree sequences2021-03-25Paper
Threshold functions for substructures in random subsets of finite vector spaces2021-02-08Paper
The average number of spanning hypertrees in sparse uniform hypergraphs2021-01-21Paper
A threshold result for loose Hamiltonicity in random regular uniform hypergraphs2020-04-07Paper
Counting independent sets in graphs with bounded bipartite pathwidth2020-02-24Paper
Uniform generation of spanning regular subgraphs of a dense graph2019-11-15Paper
Rigid Colorings of Hypergraphs and Contiguity2019-09-06Paper
Hypergraph coloring up to condensation2019-08-14Paper
The flip Markov chain for connected regular graphs2019-02-08Paper
Enumerating sparse uniform hypergraphs with given degree sequence and forbidden edges2019-01-29Paper
The switch Markov chain for sampling irregular graphs and digraphs2018-03-12Paper
The switch Markov chain for sampling irregular graphs (Extended Abstract)2017-10-05Paper
The average number of spanning trees in sparse graphs with given degrees2017-06-19Paper
Asymptotic enumeration of sparse uniform linear hypergraphs with given degrees2016-09-13Paper
Mixing of the Glauber dynamics for the ferromagnetic Potts model2016-02-03Paper
Asymptotic enumeration of sparse uniform hypergraphs with given degrees2015-09-30Paper
On the chromatic number of a random hypergraph2015-06-10Paper
https://portal.mardi4nfdi.de/entity/Q29217682014-10-13Paper
On the number of spanning trees in random regular graphs2014-09-04Paper
Structure and eigenvalues of heat-bath Markov chains2014-06-04Paper
Asymptotic Enumeration of Sparse Multigraphs with Given Degrees2014-04-10Paper
On the Number of Perfect Matchings in Random Lifts2013-03-13Paper
Counting loopy graphs with given degrees2012-03-08Paper
A polynomial bound on the mixing time of a Markov chain for sampling regular directed graphs2012-03-06Paper
Random dense bipartite graphs and directed graphs with specified degrees2010-11-09Paper
Asymptotic enumeration of correlation-immune Boolean functions2010-04-12Paper
The cycle structure of two rows in a random Latin square2009-03-04Paper
Asymptotic enumeration of sparse nonnegative integer matrices with specified row and column sums2008-11-06Paper
Expansion properties of a random regular graph after random vertex deletions2008-05-29Paper
Asymptotic enumeration of dense 0-1 matrices with specified line sums2008-02-04Paper
Sampling Regular Graphs and a Peer-to-Peer Network2008-01-18Paper
https://portal.mardi4nfdi.de/entity/Q34224102007-02-13Paper
The generalized acyclic edge chromatic number of random regular graphs2007-02-07Paper
Neighbour-distinguishing edge colourings of random regular graphs2006-08-30Paper
Bounds on the generalised acyclic chromatic numbers of bounded degree graphs2006-06-16Paper
Asymptotic enumeration of sparse 0--1 matrices with irregular row and column sums2006-03-16Paper
Generation of simple quadrangulations of the sphere2006-01-10Paper
Corrigendum: The complexity of counting graph homomorphisms2005-02-16Paper
Random hypergraph processes with degree restrictions2005-01-20Paper
The relative complexity of approximate counting problems2004-09-22Paper
https://portal.mardi4nfdi.de/entity/Q44711522004-06-18Paper
Hamiltonian decompositions of random bipartite regular graphs.2004-03-14Paper
Convergence of the Iterated Prisoner's Dilemma Game2003-03-17Paper
Permutation Pseudographs and Contiguity2003-03-09Paper
Very rapid mixing of the Glauber dynamics for proper colorings on bounded‐degree graphs2002-10-09Paper
https://portal.mardi4nfdi.de/entity/Q27537312002-01-06Paper
https://portal.mardi4nfdi.de/entity/Q45215492001-07-29Paper
An Extension of Path Coupling and Its Application to the Glauber Dynamics for Graph Colorings2001-06-21Paper
https://portal.mardi4nfdi.de/entity/Q49526242001-03-02Paper
The complexity of counting colourings and independent sets in sparse graphs and hypergraphs2000-12-19Paper
Polynomial-time counting and sampling of two-rowed contingency tables2000-10-26Paper
https://portal.mardi4nfdi.de/entity/Q49526762000-10-23Paper
On Markov Chains for Independent Sets2000-10-04Paper
An Algorithm for Recognising the Exterior Square of a Multiset2000-09-25Paper
https://portal.mardi4nfdi.de/entity/Q42502022000-06-21Paper
https://portal.mardi4nfdi.de/entity/Q47053361999-12-19Paper
https://portal.mardi4nfdi.de/entity/Q42636591999-11-21Paper
On Approximately Counting Colorings of Small Degree Graphs1999-10-28Paper
An algorithm for recognising the exterior square of a matrix1999-09-22Paper
https://portal.mardi4nfdi.de/entity/Q42190311999-07-07Paper
Theoretical and experimental comparison of efficiency of finite field extensions1996-08-13Paper
https://portal.mardi4nfdi.de/entity/Q48622081996-02-06Paper
https://portal.mardi4nfdi.de/entity/Q42880731994-04-21Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Catherine Greenhill