The following pages link to Catherine Greenhill (Q311512):
Displaying 50 items.
- Asymptotic enumeration of sparse uniform linear hypergraphs with given degrees (Q311513) (← links)
- On the number of spanning trees in random regular graphs (Q405137) (← links)
- Asymptotic enumeration of sparse uniform hypergraphs with given degrees (Q499481) (← links)
- A polynomial bound on the mixing time of a Markov chain for sampling regular directed graphs (Q665755) (← links)
- Random hypergraph processes with degree restrictions (Q704841) (← links)
- Counting loopy graphs with given degrees (Q763074) (← links)
- Asymptotic enumeration of sparse 0--1 matrices with irregular row and column sums (Q817603) (← links)
- Expansion properties of a random regular graph after random vertex deletions (Q925017) (← links)
- Asymptotic enumeration of sparse nonnegative integer matrices with specified row and column sums (Q953898) (← links)
- Hamiltonian decompositions of random bipartite regular graphs. (Q1426097) (← links)
- (Q1583094) (redirect page) (← links)
- Polynomial-time counting and sampling of two-rowed contingency tables (Q1583095) (← links)
- The complexity of counting colourings and independent sets in sparse graphs and hypergraphs (Q1590082) (← links)
- The switch Markov chain for sampling irregular graphs and digraphs (Q1704570) (← links)
- Enumerating sparse uniform hypergraphs with given degree sequence and forbidden edges (Q1715626) (← links)
- The flip Markov chain for connected regular graphs (Q1720312) (← links)
- The relative complexity of approximate counting problems (Q1879247) (← links)
- Theoretical and experimental comparison of efficiency of finite field extensions (Q1914169) (← links)
- A threshold result for loose Hamiltonicity in random regular uniform hypergraphs (Q1985454) (← links)
- A triangle process on regular graphs (Q2115867) (← links)
- The average number of spanning hypertrees in sparse uniform hypergraphs (Q2219973) (← links)
- Threshold functions for substructures in random subsets of finite vector spaces (Q2226524) (← links)
- The mixing time of switch Markov chains: a unified approach (Q2237855) (← links)
- Counting independent sets in graphs with bounded bipartite pathwidth (Q2301551) (← links)
- Uniform generation of spanning regular subgraphs of a dense graph (Q2335698) (← links)
- On the chromatic number of a random hypergraph (Q2347844) (← links)
- The average number of spanning trees in sparse graphs with given degrees (Q2357218) (← links)
- Asymptotic enumeration of correlation-immune Boolean functions (Q2380852) (← links)
- Structure and eigenvalues of heat-bath Markov chains (Q2451698) (← links)
- Asymptotic enumeration of dense 0-1 matrices with specified line sums (Q2469197) (← links)
- Bounds on the generalised acyclic chromatic numbers of bounded degree graphs (Q2494116) (← links)
- Neighbour-distinguishing edge colourings of random regular graphs (Q2500996) (← links)
- Generation of simple quadrangulations of the sphere (Q2581402) (← links)
- Mixing time of the switch Markov chain and stable degree sequences (Q2659068) (← links)
- Lower bounds on the chromatic number of random graphs (Q2678448) (← links)
- An Extension of Path Coupling and Its Application to the Glauber Dynamics for Graph Colorings (Q2719118) (← links)
- (Q2753731) (← links)
- (Q2921768) (← links)
- Random dense bipartite graphs and directed graphs with specified degrees (Q3055774) (← links)
- Permutation Pseudographs and Contiguity (Q3147239) (← links)
- Convergence of the Iterated Prisoner's Dilemma Game (Q3147275) (← links)
- Corrigendum: The complexity of counting graph homomorphisms (Q3159461) (← links)
- The generalized acyclic edge chromatic number of random regular graphs (Q3419704) (← links)
- (Q3422410) (← links)
- Mixing of the Glauber dynamics for the ferromagnetic Potts model (Q3467578) (← links)
- The cycle structure of two rows in a random Latin square (Q3608297) (← links)
- (Q4219031) (← links)
- (Q4250202) (← links)
- (Q4263659) (← links)
- An algorithm for recognising the exterior square of a matrix (Q4264517) (← links)
