An upper bound for the number of spanning trees of a graph. - Geoffrey R. Grimmett (Discret. Math., 1976)

The shortest-path problem for graphs with random arc-lengths. - Alan M. Frieze; Geoffrey R. Grimmett (Discret. Appl. Math., 1985)

An exact threshold theorem for random graphs and the node-packing problem. - Geoffrey R. Grimmett (J. Comb. Theory B, 1986)

Infinite paths in randomly oriented lattices. - Geoffrey R. Grimmett (Random Struct. Algorithms, 2001)

On smallest triangles. - Geoffrey R. Grimmett; Svante Janson (Random Struct. Algorithms, 2003)

Negative association in uniform forests and connected graphs. - Geoffrey R. Grimmett; Stephan N. Winkler (Random Struct. Algorithms, 2004)

Stochastic Apportionment. - Geoffrey R. Grimmett (Am. Math. Mon., 2004)

Random Even Graphs. - Geoffrey R. Grimmett; Svante Janson (Electron. J. Comb., 2009)

Random graphs with forbidden vertex degrees. - Geoffrey R. Grimmett; Svante Janson (Random Struct. Algorithms, 2010)

Percolation of arbitrary words in one dimension. - Geoffrey R. Grimmett; Thomas M. Liggett; Thomas Richthammer (Random Struct. Algorithms, 2010)

European apportionment via the Cambridge Compromise. - Geoffrey R. Grimmett (Math. Soc. Sci., 2012)

A power-weighted variant of the EU27 Cambridge Compromise. - Geoffrey R. Grimmett; Kai-Friederike Oelbermann; Friedrich Pukelsheim (Math. Soc. Sci., 2012)

Self-Avoiding Walks and the Fisher Transformation. - Geoffrey R. Grimmett; Zhongyang Li (Electron. J. Comb., 2013)

Strict Inequalities for Connective Constants of Transitive Graphs. - Geoffrey R. Grimmett; Zhongyang Li (SIAM J. Discret. Math., 2014)

Bounds on connective constants of regular graphs. - Geoffrey R. Grimmett; Zhongyang Li (Comb., 2015)

Self-Avoiding Walks and Amenability. - Geoffrey R. Grimmett; Zhongyang Li (Electron. J. Comb., 2017)

Locality of connective constants. - Geoffrey R. Grimmett; Zhongyang Li (Discret. Math., 2018)

On influence and compromise in two-tier voting systems. - Geoffrey R. Grimmett (Math. Soc. Sci., 2019)

Cubic graphs and the golden mean. - Geoffrey R. Grimmett; Zhongyang Li (Discret. Math., 2020)

Percolation critical probabilities of matching lattice-pairs. - Geoffrey R. Grimmett; Zhongyang Li (Random Struct. Algorithms, 2024)

Hyperbolic Site Percolation. - Geoffrey R. Grimmett; Zhongyang Li (Random Struct. Algorithms, 2025)