Home
About
Advanced Search
Browse by Discipline
Scientific Societies
E-print Alerts
Add E-prints
FAQ
•
HELP
•
SITE MAP
•
CONTACT US
Search
Advanced Search
Greenhill, Catherine - School of Mathematics and Statistics, University of New South Wales
On the number of perfect matchings in random lifts Catherine Greenhill
Hamiltonian decompositions of random bipartite regular Catherine Greenhill
A more rapidly mixing Markov chain for graph colourings Martin Dyer and Catherine Greenhill
A polynomial bound on the mixing time of a Markov chain for sampling regular directed graphs
Asymptotic enumeration of sparse nonnegative integer matrices with specified row and column sums
The cycle structure of two rows in a random latin square
Asymptotic enumeration of dense 0-1 matrices with specified line sums
Random hypergraph processes with degree restrictions
An extension of path coupling and its application to the Glauber dynamics for graph colourings
The complexity of counting colourings and independent sets in sparse graphs and hypergraphs
Corrigendum: The complexity of counting graph homomorphisms
On approximately counting colourings of small degree Russ Bubley,
Theoretical and experimental comparison of efficiency of finite field extensions
Maple calculations for the paper "On the number of perfect matchings of random lifts", Catherine Greenhill, Svante Janson, Andrzej Rucinski.
Counting loopy graphs with given degrees Catherine Greenhill
Asymptotic enumeration of correlation-immune boolean functions
Sudoku, logic and proof Catherine Greenhill
Diana Combe All my research is in areas of combinatorics and algebra. I am inter-
An algorithm for recognising the exterior square of a Catherine Greenhill
An algorithm for recognising the exterior square of a matrix Keywords: matrix, exterior square, algorithm
Permutation pseudographs and contiguity Catherine Greenhill
Bounds on the generalised acyclic chromatic numbers of bounded degree graphs
Random Walks on Combinatorial Objects Martin Dyer and Catherine Greenhill
Random dense bipartite graphs and directed graphs with specified degrees