What is he best known for?
The fields of study he is best known for:
- Combinatorics
- Discrete mathematics
- Geometry
His primary areas of investigation include Discrete mathematics, Combinatorics, Chordal graph, Indifference graph and Random regular graph.
His studies deal with areas such as Spectrum, Order and Degree as well as Discrete mathematics.
His study explores the link between Degree and topics such as Strongly regular graph that cross with problems in Probability density function, Eigenvalue distribution, Sequence and Eigenvalues and eigenvectors.
His Combinatorics research is multidisciplinary, incorporating elements of Order and Symmetry group.
In his study, Isomorphism is strongly linked to Quasigroup, which falls under the umbrella field of Symmetry group.
He has included themes like 1-planar graph, Pathwidth and Split graph in his Indifference graph study.
His most cited work include:
- Practical graph isomorphism, II (1219 citations)
- Isomorph-Free Exhaustive Generation (428 citations)
- The expected eigenvalue distribution of a large regular graph (313 citations)
What are the main themes of his work throughout his whole career to date?
Brendan D. McKay focuses on Combinatorics, Discrete mathematics, Enumeration, Random graph and Bipartite graph.
His research on Combinatorics frequently links to adjacent areas such as Order.
He interconnects Isomorphism and Constant in the investigation of issues within Order.
While the research belongs to areas of Enumeration, Brendan D. McKay spends his time largely on the problem of Integer, intersecting his research to questions surrounding Bounded function and Diagonal.
His work focuses on many connections between Random graph and other disciplines, such as Spanning tree, that overlap with his field of interest in Expected value.
His Indifference graph research includes elements of Cograph and Pancyclic graph.
He most often published in these fields:
- Combinatorics (81.78%)
- Discrete mathematics (55.08%)
- Enumeration (11.86%)
What were the highlights of his more recent work (between 2016-2021)?
- Combinatorics (81.78%)
- Graph (9.32%)
- Random graph (11.44%)
In recent papers he was focusing on the following fields of study:
His scientific interests lie mostly in Combinatorics, Graph, Random graph, Enumeration and Ramsey's theorem.
His work in Combinatorics addresses subjects such as Expected value, which are connected to disciplines such as Spanning tree.
His Graph research also works with subjects such as
- Natural number that intertwine with fields like Order,
- Mathematical proof, which have a strong connection to Reconstruction conjecture, Equivalence, Unipotent and Idempotence.
His work in Random graph covers topics such as Exponential function which are related to areas like Truncated normal distribution and Rasch model.
Brendan D. McKay has included themes like Maximum likelihood, Estimator and Asymptotic formula in his Enumeration study.
His Ramsey's theorem research is multidisciplinary, relying on both Class and Graph theory.
Between 2016 and 2021, his most popular works were:
- Planar Hypohamiltonian Graphs on 40 Vertices (19 citations)
- The average number of spanning trees in sparse graphs with given degrees (17 citations)
- On Ryser's conjecture for linear intersecting multipartite hypergraphs (15 citations)
In his most recent research, the most cited papers focused on:
- Combinatorics
- Algebra
- Geometry
Brendan D. McKay mostly deals with Combinatorics, Random graph, Graph, Discrete mathematics and Cover.
His studies in Combinatorics integrate themes in fields like Rasch model and Truncated normal distribution.
The concepts of his Random graph study are interwoven with issues in Expected value, Exponential function, Bipartite graph and Spanning tree.
His Graph research is multidisciplinary, incorporating elements of Natural number, Upper and lower bounds, Order and Subroutine.
His work in Pancyclic graph, Grinberg's theorem, Polyhedral graph, Book embedding and Outerplanar graph is related to Discrete mathematics.
His Cover research incorporates themes from Degree, Conjecture, Random minimum spanning tree, Giant component and Almost surely.
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.
