Geoffrey R. Grimmett

Affiliations:
  • University of Cambridge, UK


According to our database1, Geoffrey R. Grimmett authored at least 19 papers between 1976 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2020
Cubic graphs and the golden mean.
Discret. Math., 2020

2019
On influence and compromise in two-tier voting systems.
Math. Soc. Sci., 2019

2018
Locality of connective constants.
Discret. Math., 2018

2017
Self-Avoiding Walks and Amenability.
Electron. J. Comb., 2017

2015
Bounds on connective constants of regular graphs.
Comb., 2015

2014
Strict Inequalities for Connective Constants of Transitive Graphs.
SIAM J. Discret. Math., 2014

2013
Self-Avoiding Walks and the Fisher Transformation.
Electron. J. Comb., 2013

2012
A power-weighted variant of the EU27 Cambridge Compromise.
Math. Soc. Sci., 2012

European apportionment via the Cambridge Compromise.
Math. Soc. Sci., 2012

2010
Percolation of arbitrary words in one dimension.
Random Struct. Algorithms, 2010

Random graphs with forbidden vertex degrees.
Random Struct. Algorithms, 2010

2009
Random Even Graphs.
Electron. J. Comb., 2009

2004
Stochastic Apportionment.
Am. Math. Mon., 2004

Negative association in uniform forests and connected graphs.
Random Struct. Algorithms, 2004

2003
On smallest triangles.
Random Struct. Algorithms, 2003

2001
Infinite paths in randomly oriented lattices.
Random Struct. Algorithms, 2001

1986
An exact threshold theorem for random graphs and the node-packing problem.
J. Comb. Theory, Ser. B, 1986

1985
The shortest-path problem for graphs with random arc-lengths.
Discret. Appl. Math., 1985

1976
An upper bound for the number of spanning trees of a graph.
Discret. Math., 1976


  Loading...