Book · 2007

Combinatorics, Complexity, and Chance

Geoffrey Grimmett, Colin McDiarmid

Oxford University Press · Published 18 January 2007 · DOI 10.1093/acprof:oso/9780198571278.001.0001

View at the publisherCite this paper

In brief

“Combinatorics, Complexity, and Chance” is a 2007 book by Geoffrey Grimmett and Colin McDiarmid. OpenAlex counts 43 citations as of 15 November 2026. The publisher's version is not open access, and OpenAlex records no free legal copy.

Citations
43
Most cited in
2015 (5)
Field-weighted impact
2.55
Authors
2

Cite this paper

Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.

APA 7

Grimmett, G., & McDiarmid, C. (2007). Combinatorics, Complexity, and Chance. Oxford University Press. https://doi.org/10.1093/acprof:oso/9780198571278.001.0001

MLA 9

Grimmett, Geoffrey, and Colin McDiarmid. Combinatorics, Complexity, and Chance. Oxford University Press, 2007. https://doi.org/10.1093/acprof:oso/9780198571278.001.0001.

Chicago

Grimmett, Geoffrey and Colin McDiarmid. 2007. Combinatorics, Complexity, and Chance. Oxford University Press. https://doi.org/10.1093/acprof:oso/9780198571278.001.0001.

Harvard

Grimmett, G. and McDiarmid, C. (2007) Combinatorics, Complexity, and Chance. Oxford University Press. doi:10.1093/acprof:oso/9780198571278.001.0001.

IEEE

G. Grimmett and C. McDiarmid, Combinatorics, Complexity, and Chance. Oxford University Press, 2007, doi: 10.1093/acprof:oso/9780198571278.001.0001.

BibTeX

@book{grimmett2007combinatorics,
  title     = {{Combinatorics, Complexity, and Chance}},
  author    = {Grimmett, Geoffrey and McDiarmid, Colin},
  publisher = {Oxford University Press},
  year      = {2007},
  doi       = {10.1093/acprof:oso/9780198571278.001.0001},
  url       = {https://doi.org/10.1093/acprof:oso/9780198571278.001.0001}
}

Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)

Citations by year

YearCitationsShare of the best year
201233
201311
201433
201555
201722
201811
201911
202011
202222
202522

Its field-weighted citation impact is 2.55: it has been cited 2.55 times as often as the average work of the same field, type and year (1.00 is the world average).

Topic and keywords

Physical Sciences › Mathematics › Discrete Mathematics and Combinatorics › Advanced Combinatorial Mathematics

  • combinatorics
  • computational complexity
  • probability

Work with this paper

Most-cited papers in Mathematics

All highly cited Mathematics papers

Questions about this paper

How do I cite this paper in APA style?

Grimmett, G., & McDiarmid, C. (2007). Combinatorics, Complexity, and Chance. Oxford University Press. https://doi.org/10.1093/acprof:oso/9780198571278.001.0001

How many times has this paper been cited?

43 times, according to OpenAlex on 15 November 2026. Google Scholar and Scopus count different sets of sources, so their numbers differ.

Is this paper free to read?

OpenAlex records no free legal copy. Check your library's access, the authors' pages or a repository, or ask the corresponding author for a copy.

Who wrote this paper?

Geoffrey Grimmett, Colin McDiarmid.

What is the DOI of this paper?

10.1093/acprof:oso/9780198571278.001.0001. The permanent link is https://doi.org/10.1093/acprof:oso/9780198571278.001.0001.

Bibliographic data from OpenAlex (CC0), last checked 15 November 2026. ResearchGuru does not host this paper; the links go to the publisher or the repository that does.