Geoffrey R. Grimmett

Publication Activity (10 Years)

Years Active: 1976-2020
Publications (10 Years): 4

Top Topics

Weighted Distance

Graph Theoretic

Linear Discriminant

Top Venues

Math. Soc. Sci.

Electron. J. Comb.

Publications

Geoffrey R. Grimmett, Zhongyang Li
Cubic graphs and the golden mean. Discret. Math. 343 (1) (2020)
Geoffrey R. Grimmett
On influence and compromise in two-tier voting systems. Math. Soc. Sci. 100 (2019)
Geoffrey R. Grimmett, Zhongyang Li
Locality of connective constants. Discret. Math. 341 (12) (2018)
Geoffrey R. Grimmett, Zhongyang Li
Self-Avoiding Walks and Amenability. Electron. J. Comb. 24 (4) (2017)
Geoffrey R. Grimmett, Zhongyang Li
Bounds on connective constants of regular graphs. Comb. 35 (3) (2015)
Geoffrey R. Grimmett, Zhongyang Li
Strict Inequalities for Connective Constants of Transitive Graphs. SIAM J. Discret. Math. 28 (3) (2014)
Geoffrey R. Grimmett, Zhongyang Li
Self-Avoiding Walks and the Fisher Transformation. Electron. J. Comb. 20 (3) (2013)
Geoffrey R. Grimmett, Kai-Friederike Oelbermann, Friedrich Pukelsheim
A power-weighted variant of the EU27 Cambridge Compromise. Math. Soc. Sci. 63 (2) (2012)
Geoffrey R. Grimmett
European apportionment via the Cambridge Compromise. Math. Soc. Sci. 63 (2) (2012)
Geoffrey R. Grimmett, Thomas M. Liggett, Thomas Richthammer
Percolation of arbitrary words in one dimension. Random Struct. Algorithms 37 (1) (2010)
Geoffrey R. Grimmett, Svante Janson
Random graphs with forbidden vertex degrees. Random Struct. Algorithms 37 (2) (2010)
Geoffrey R. Grimmett, Svante Janson
Random Even Graphs. Electron. J. Comb. 16 (1) (2009)
Geoffrey R. Grimmett, Stephan N. Winkler
Negative association in uniform forests and connected graphs. Random Struct. Algorithms 24 (4) (2004)
Geoffrey R. Grimmett
Stochastic Apportionment. Am. Math. Mon. 111 (4) (2004)
Geoffrey R. Grimmett, Svante Janson
On smallest triangles. Random Struct. Algorithms 23 (2) (2003)
Geoffrey R. Grimmett
Infinite paths in randomly oriented lattices. Random Struct. Algorithms 18 (3) (2001)
Geoffrey R. Grimmett
An exact threshold theorem for random graphs and the node-packing problem. J. Comb. Theory, Ser. B 40 (2) (1986)
Alan M. Frieze, Geoffrey R. Grimmett
The shortest-path problem for graphs with random arc-lengths. Discret. Appl. Math. 10 (1) (1985)
Geoffrey R. Grimmett
An upper bound for the number of spanning trees of a graph. Discret. Math. 16 (4) (1976)