- Home
- Best Scientists - Mathematics
- Colin McDiarmid

Discipline name
D-index
D-index (Discipline H-index) only includes papers and citation values for an examined
discipline in contrast to General H-index which accounts for publications across all
disciplines.
Citations
Publications
World Ranking
National Ranking

Mathematics
D-index
37
Citations
4,933
163
World Ranking
1706
National Ranking
118

Engineering and Technology
D-index
37
Citations
4,906
156
World Ranking
4615
National Ranking
296

- Combinatorics
- Mathematical analysis
- Discrete mathematics

His main research concerns Combinatorics, Discrete mathematics, Random graph, Indifference graph and Random regular graph. His work is connected to 1-planar graph, Line graph, Graph, Vertex and Disjoint sets, as a part of Combinatorics. His studies deal with areas such as Chromatic scale and Demand vector as well as Graph.

His research is interdisciplinary, bridging the disciplines of Degree and Discrete mathematics. His study in Indifference graph is interdisciplinary in nature, drawing from both Pathwidth, Split graph and Chordal graph. His Split graph research includes elements of Universal graph, Pancyclic graph and Graph product.

- On colouring random graphs (317 citations)
- Acyclic coloring of graphs (211 citations)
- Random planar graphs (152 citations)

His primary scientific interests are in Combinatorics, Discrete mathematics, Random graph, Graph and Random regular graph. Chromatic scale, Vertex, Vertex, 1-planar graph and Planar graph are subfields of Combinatorics in which his conducts study. His Discrete mathematics study frequently involves adjacent topics like Upper and lower bounds.

Colin McDiarmid has researched Random graph in several fields, including Disjoint sets, Class, Time complexity and Line graph. When carried out as part of a general Graph research project, his work on Clique number is frequently linked to work in Expected value, therefore connecting diverse disciplines of study. His work carried out in the field of Random regular graph brings together such families of science as Pancyclic graph and Book embedding.

- Combinatorics (85.56%)
- Discrete mathematics (59.89%)
- Random graph (27.81%)

- Combinatorics (85.56%)
- Graph (18.72%)
- Discrete mathematics (59.89%)

Colin McDiarmid mainly investigates Combinatorics, Graph, Discrete mathematics, Random graph and Vertex. Colin McDiarmid undertakes interdisciplinary study in the fields of Combinatorics and High probability through his research. His Graph research includes elements of Open problem and Euler's formula.

His research links Packing problems with Discrete mathematics. The various areas that Colin McDiarmid examines in his Random graph study include Random regular graph, Modularity and Clique. His research investigates the connection with Vertex and areas like Degree which intersect with concerns in Cubic graph and Treewidth.

- Modularity of regular and treelike graphs (11 citations)
- Extremal Distances for Subtree Transfer Operations in Binary Trees (8 citations)
- Random Graphs, Geometry and Asymptotic Structure (8 citations)

- Combinatorics
- Mathematical analysis
- Graph theory

Combinatorics, Graph, Vertex, Random graph and Time complexity are his primary areas of study. His study connects Tree and Combinatorics. Colin McDiarmid has included themes like Open problem and Euler's formula in his Graph study.

His Vertex research includes themes of Hypercube and Multi-commodity flow problem. His Random graph research integrates issues from Disjoint sets, Modularity and Extremal graph theory. His study looks at the intersection of Time complexity and topics like Binary logarithm with Vertex and Random geometric graph.

This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.

On colouring random graphs

G. R. Grimmett;C. J. H. McDiarmid.

Mathematical Proceedings of the Cambridge Philosophical Society **(1975)**

465 Citations

Acyclic coloring of graphs

Noga Alon;Colin Mcdiarmid;Bruce Reed.

Random Structures and Algorithms **(1991)**

318 Citations

Algorithmic theory of random graphs

Alan Frieze;Colin McDiarmid.

Random Structures and Algorithms **(1997)**

220 Citations

Random planar graphs

Colin McDiarmid;Angelika Steger;Dominic J. A. Welsh.

Journal of Combinatorial Theory, Series B **(2005)**

177 Citations

Small transversals in hypergraphs

Vasek Chvátal;Colin McDiarmid.

Combinatorica **(1992)**

174 Citations

Channel Assignment and Weighted Coloring

Colin McDiarmid;Bruce A. Reed.

Networks **(2000)**

166 Citations

Vertex-Colouring Edge-Weightings

Louigi Addario-Berry;Ketan Dalal;Colin McDiarmid;Bruce A. Reed.

Combinatorica **(2007)**

142 Citations

On integer points in polyhedra

William J. Cook;Mark Hartmann;Ravi Kannan;Colin McDiarmid.

Combinatorica **(1992)**

109 Citations

On the maximum queue length in the supermarket model

Malwina J. Luczak;Colin McDiarmid.

Annals of Probability **(2006)**

105 Citations

Rado's theorem for polymatroids

Colin J. H. McDiarmid.

Mathematical Proceedings of the Cambridge Philosophical Society **(1975)**

95 Citations

If you think any of the details on this page are incorrect, let us know.

Contact us

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

McGill University

Carnegie Mellon University

ETH Zurich

Tel Aviv University

Uppsala University

University of Cambridge

University of Leeds

University of Bath

Tel Aviv University

University of Toronto

King Abdullah University of Science and Technology

Connected Action Consulting Group

The Ohio State University

Independent Scientist / Consultant, US

Queen's University

Government College University, Lahore

Centre national de la recherche scientifique, CNRS

University of Lausanne

Marondera University of Agricultural Sciences and Technology

Karolinska Institute

Lancaster University

Université du Québec à Rimouski

Palacký University, Olomouc

INRAE : Institut national de recherche pour l'agriculture, l'alimentation et l'environnement

University of Ulm

Duke University

Something went wrong. Please try again later.