Brendan D. McKay
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Research Interests
Brendan D. McKay has a total of 103 co-authors. Here are the top co-authors by number of shared publications:
- Mikhail Isaev
School of Mathematics and Statistics , UNSW Sydney , Sydney , NSW , Australia
13 shared publications - Catherine Greenhill
School of Mathematics and Statistics The University of New South Wales Sydney NSW 2052 Australia
8 shared publications - Catherine Greenhill
UNSW Sydney
6 shared publications - Mahdieh Hasheminezhad
Department of Computer Science, Yazd University, Yazd, Iran
5 shared publications - E. Rodney Canfield
Department of Computer Science University of Georgia 30602 Athens GA USA
4 shared publications - Gunnar Brinkmann
Ghent University, Belgium
4 shared publications
Latest Publications
- Open Access
- 9 October 2026
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 396, 328-341
Asymptotic enumeration of constrained bipartite, directed and oriented graphs by degree sequence
- 9 October 2026
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 396, 328-341
Open AccessAsymptotic enumeration of constrained bipartite, directed and oriented graphs by degree sequence
- 5 October 2026
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Discrete Mathematics
- Vol. 40 (4) , 1644-1666
Enumeration of Regular Multipartite Hypergraphs
We determine the asymptotic number of regular multipartite hypergraphs, also known as multidimensional binary contingency tables, for all values of the parameters.
- 5 October 2026
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Discrete Mathematics
- Vol. 40 (4) , 1644-1666
Enumeration of Regular Multipartite Hypergraphs
We determine the asymptotic number of regular multipartite hypergraphs, also known as multidimensional binary contingency tables, for all values of the parameters.
- Open Access
- 20 March 2026
- Published by Wiley in Journal of Graph Theory
- Vol. 112 (3) , 198-208
R(5,5)≤46
We prove that the Ramsey number is less than or equal to 46. The proof uses a combination of linear programming and checking a large number of cases by computer. All of the computational parts of the proof were independently implemented by both authors, with consistent results.
- 20 March 2026
- Published by Wiley in Journal of Graph Theory
- Vol. 112 (3) , 198-208
Open AccessR(5,5)≤46
We prove that the Ramsey number is less than or equal to 46. The proof uses a combination of linear programming and checking a large number of cases by computer. All of the computational parts of the proof were independently implemented by both authors, with consistent results.
- Open Access
Asymptotic enumeration of constrained bipartite, directed and oriented graphs by degree sequence
In the sufficiently sparse case, we find the probability that a uniformly random bipartite graph with given degree sequence contains no edge from a specified set of edges. This enables us to enumerate loop-free digraphs and oriented graphs with given in-degree and out-degree sequences, and obtain subgraph probabilities. Our theorems are not restricted to the near-regular case. As an application, we determine the expected permanent of sparse or very dense random matrices with given row and column sums; in the regular case, our formula holds over all densities. We also draw conclusions about the degrees of a random orientation of a random undirected graph with given degrees, including its number of Eulerian orientations.
Open AccessAsymptotic enumeration of constrained bipartite, directed and oriented graphs by degree sequence
In the sufficiently sparse case, we find the probability that a uniformly random bipartite graph with given degree sequence contains no edge from a specified set of edges. This enables us to enumerate loop-free digraphs and oriented graphs with given in-degree and out-degree sequences, and obtain subgraph probabilities. Our theorems are not restricted to the near-regular case. As an application, we determine the expected permanent of sparse or very dense random matrices with given row and column sums; in the regular case, our formula holds over all densities. We also draw conclusions about the degrees of a random orientation of a random undirected graph with given degrees, including its number of Eulerian orientations.
- Open Access
Asymptotic enumeration of graph factors by cumulant expansion
Let $G$ be a dense graph with good expansion properties and not too close to being bipartite. Let $\boldsymbol d$ be a graphical degree sequence. Under very weak conditions, we find the number of subgraphs of $G$ with degree sequence $\boldsymbol d$ to arbitrary precision. The average degree can be any power of $n$ and the variation in degrees can be very large. The method uses an explicit bound on the tail of the cumulant generating function found by the first author. As a first application, we prove that there is an asymptotic expansion for the number of regular graphs and find several terms explicitly. We believe that this is the first combinatorial application of the Fourier inversion method for which the integral outside the dominant regions cannot be bounded by the integral of the absolute value, and we give a general method for dealing with that situation.Open AccessAsymptotic enumeration of graph factors by cumulant expansion
Let $G$ be a dense graph with good expansion properties and not too close to being bipartite. Let $\boldsymbol d$ be a graphical degree sequence. Under very weak conditions, we find the number of subgraphs of $G$ with degree sequence $\boldsymbol d$ to arbitrary precision. The average degree can be any power of $n$ and the variation in degrees can be very large. The method uses an explicit bound on the tail of the cumulant generating function found by the first author. As a first application, we prove that there is an asymptotic expansion for the number of regular graphs and find several terms explicitly. We believe that this is the first combinatorial application of the Fourier inversion method for which the integral outside the dominant regions cannot be bounded by the integral of the absolute value, and we give a general method for dealing with that situation. - 3 July 2025
- Published by Springer Nature
- p. 283-287
Chromatically Equivalent Chordal Graphs
- 25 March 2025
- Published by European Mathematical Society - EMS - Publishing House GmbH in Annales de l’Institut Henri Poincaré D, Combinatorics, Physics and their Interactions
Correlation between residual entropy and spanning tree entropy of ice-type models on graphs
The logarithm of the number of Eulerian orientations, normalised by the number of vertices, is known as the residual entropy in studies of ice-type models on graphs. The spanning tree entropy depends similarly on the number of spanning trees. We demonstrate and investigate a remarkably strong, though non-deterministic, correlation between these two entropies. This leads us to propose a new heuristic estimate for the residual entropy of regular graphs that performs much better than previous heuristics. We also study the expansion properties and residual entropy of random graphs with given degrees.
- 25 March 2025
- Published by European Mathematical Society - EMS - Publishing House GmbH in Annales de l’Institut Henri Poincaré D, Combinatorics, Physics and their Interactions
Correlation between residual entropy and spanning tree entropy of ice-type models on graphs
The logarithm of the number of Eulerian orientations, normalised by the number of vertices, is known as the residual entropy in studies of ice-type models on graphs. The spanning tree entropy depends similarly on the number of spanning trees. We demonstrate and investigate a remarkably strong, though non-deterministic, correlation between these two entropies. This leads us to propose a new heuristic estimate for the residual entropy of regular graphs that performs much better than previous heuristics. We also study the expansion properties and residual entropy of random graphs with given degrees.
- Open Access
Enumeration of regular multipartite hypergraphs
We determine the asymptotic number of regular multipartite hypergraphs, also known as multidimensional binary contingency tables, for all values of the parameters.
Open AccessEnumeration of regular multipartite hypergraphs
We determine the asymptotic number of regular multipartite hypergraphs, also known as multidimensional binary contingency tables, for all values of the parameters.
- Open Access
- 24 January 2025
- Published by Elsevier in Journal of Combinatorial Theory, Series B
- Vol. 172, 263-314
Cumulant expansion for counting Eulerian orientations
- 24 January 2025
- Published by Elsevier in Journal of Combinatorial Theory, Series B
- Vol. 172, 263-314
Open AccessCumulant expansion for counting Eulerian orientations