Brendan D. McKay

From MaRDI portal
Revision as of 07:10, 7 October 2023 by Import231006081045 (talk | contribs) (Created automatically from import231006081045)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:168496

Available identifiers

zbMath Open mckay.brendan-dDBLP74/5295WikidataQ10559614 ScholiaQ10559614MaRDI QIDQ168496

List of research outcomes





PublicationDate of PublicationType
Enumeration of Latin squares with conjugate symmetry2024-02-05Paper
Factorisation of the complete bipartite graph into spanning semiregular factors2023-11-15Paper
Cumulant expansion for counting Eulerian orientations2023-09-27Paper
Correction to: ``Sandwiching dense random regular graphs between binomial random graphs2023-09-08Paper
Sprinkling with random regular graphs2023-08-31Paper
Degree sequences of sufficiently dense random uniform hypergraphs2023-04-03Paper
Factorisation of the complete graph into spanning regular factors2023-03-09Paper
Sandwiching dense random regular graphs between binomial random graphs2022-10-24Paper
Paths through equally spaced points on a circle2022-10-06Paper
Reconstruction of small graphs and digraphs2022-07-20Paper
Factorisation of the complete graph into spanning regular factors2022-06-26Paper
The minimality of the Georges–Kelmans graph2022-04-13Paper
Asymptotic enumeration of non-uniform linear hypergraphs2022-01-03Paper
Addressing Johnson Graphs, Complete Multipartite Graphs, Odd Cycles, and Random Graphs2021-11-03Paper
Subgraph counts for dense random graphs with specified degrees2021-06-15Paper
The \(r\)-switching-stable graphs2021-05-19Paper
Sandwiching random regular graphs between binomial random graphs2021-02-02Paper
Kim--Vu's sandwich conjecture is true for $d \geq \log^4 n$2020-11-18Paper
A class of Ramsey-extremal hypergraphs2020-11-17Paper
The Iteration Number of Colour Refinement2020-05-20Paper
Asymptotic enumeration of linear hypergraphs with given number of vertices and edges2020-02-27Paper
Asymptotic enumeration of orientations of a graph as a function of the out-degree sequence2020-01-27Paper
ARTICLES2018-10-31Paper
Complex martingales and asymptotic enumeration2018-09-05Paper
https://portal.mardi4nfdi.de/entity/Q45941952017-11-17Paper
Fullerenes with distant pentagons2017-07-19Paper
Hypohamiltonian Planar Cubic Graphs with Girth 52017-06-30Paper
The average number of spanning trees in sparse graphs with given degrees2017-06-19Paper
$R(5,5) \le 48$2017-03-26Paper
Planar Hypohamiltonian Graphs on 40 Vertices2017-02-01Paper
On Ryser's conjecture for linear intersecting multipartite hypergraphs2016-12-27Paper
A faster test for 4-flow-criticality in snarks2016-10-17Paper
https://portal.mardi4nfdi.de/entity/Q28161212016-07-01Paper
On a bound of Hoeffding in the complex case2016-05-23Paper
Degree sequences of random digraphs and bipartite graphs2016-02-19Paper
Recursive generation of IPR fullerenes2015-09-28Paper
The Order of Automorphisms of Quasigroups2015-08-11Paper
Graph approach to quantum systems2015-06-05Paper
Circular designs balanced for neighbours at distances one and two2014-12-22Paper
Switching Reconstruction of Digraphs2014-08-07Paper
Competition Numbers, Quasi-line Graphs, and Holes2014-06-19Paper
Asymptotic Enumeration of Sparse Multigraphs with Given Degrees2014-04-10Paper
There are 2834 spreads of lines in PG(3,8)2014-04-06Paper
The Generation of Fullerenes2014-03-25Paper
Practical graph isomorphism. II.2014-03-03Paper
Recursive generation of simple planar 5-regular graphs and pentangulations2013-11-28Paper
https://portal.mardi4nfdi.de/entity/Q28487392013-09-26Paper
ASYMPTOTIC ENUMERATION OF SYMMETRIC INTEGER MATRICES WITH UNIFORM ROW SUMS2013-04-24Paper
A Note on the History of the Four‐Colour Conjecture2013-04-19Paper
Asymptotic enumeration of integer matrices with large equal row and column sums2013-04-05Paper
Counting loopy graphs with given degrees2012-03-08Paper
https://portal.mardi4nfdi.de/entity/Q30967052011-11-11Paper
Computational determination of (3,11) and (4,7) cages2011-07-29Paper
https://portal.mardi4nfdi.de/entity/Q30014092011-05-31Paper
https://portal.mardi4nfdi.de/entity/Q30038862011-05-31Paper
Subgraphs of Dense Random Graphs with Specified Degrees2011-05-11Paper
Recursive generation of simple planar quadrangulations with vertices of degree 3 and 42010-12-08Paper
Random dense bipartite graphs and directed graphs with specified degrees2010-11-09Paper
To be or not to be Yutsis: algorithms for the decision problem2010-10-18Paper
Rectangular-radial drawings of cubic plane graphs2010-09-02Paper
The asymptotic volume of the Birkhoff polytope2010-06-03Paper
Subgraphs of Randomk-Edge-Colouredk-Regular Graphs2010-04-22Paper
Asymptotic enumeration of correlation-immune Boolean functions2010-04-12Paper
A Census of Small Latin Hypercubes2009-05-27Paper
Graph structural properties of non-Yutsis graphs allowing fast recognition2009-03-04Paper
Recursive Generation of 5-Regular Planar Graphs2009-02-24Paper
Spherical-Rectangular Drawings2009-02-24Paper
Asymptotic enumeration of sparse nonnegative integer matrices with specified row and column sums2008-11-06Paper
https://portal.mardi4nfdi.de/entity/Q54425312008-02-22Paper
Asymptotic enumeration of dense 0-1 matrices with specified line sums2008-02-04Paper
Small latin squares, quasigroups, and loops2007-03-20Paper
The number of transversals in a Latin square2006-11-22Paper
A linear time algorithm for constructing maximally symmetric straight line drawings of triconnected planar graphs2006-10-04Paper
Asymptotic enumeration of sparse 0--1 matrices with irregular row and column sums2006-03-16Paper
https://portal.mardi4nfdi.de/entity/Q33690552006-02-13Paper
Generation of simple quadrangulations of the sphere2006-01-10Paper
Construction of planar triangulations with minimum degree 52006-01-10Paper
On the number of Latin squares2005-11-02Paper
Asymptotic enumeration of dense 0-1 matrices with equal row sums and equal column sums2005-11-01Paper
https://portal.mardi4nfdi.de/entity/Q54635272005-08-04Paper
https://portal.mardi4nfdi.de/entity/Q30240122005-07-11Paper
https://portal.mardi4nfdi.de/entity/Q30240212005-07-11Paper
Kochen Specker vectors2005-06-09Paper
Short cycles in random regular graphs2005-04-25Paper
Kochen–Specker vectors2005-04-18Paper
https://portal.mardi4nfdi.de/entity/Q48289542004-11-29Paper
The asymptotic number of claw-free cubic graphs.2003-12-04Paper
Asymptotic enumeration of 0-1 matrices with equal row sums and equal column sums2003-11-19Paper
The probability of collective choice with shared knowledge structures2003-04-02Paper
Asymptotic Enumeration of Graphs with a Given Upper Bound on the Maximum Degree2002-10-14Paper
Posets on up to 16 points2002-09-18Paper
The distributions of the entries of Young tableaux2002-07-04Paper
https://portal.mardi4nfdi.de/entity/Q27604512002-01-02Paper
Asymptotic enumeration of tournaments with a given score sequence containing a specified digraph2001-11-18Paper
https://portal.mardi4nfdi.de/entity/Q27413252001-09-23Paper
Algorithms for Greechie diagrams2001-03-29Paper
https://portal.mardi4nfdi.de/entity/Q42645642000-06-04Paper
Nonhamiltonian 3-Connected Cubic Planar Graphs2000-03-19Paper
Cycles through 23 vertices in 3-connected cubic planar graphs2000-01-30Paper
Most Latin squares have many subsquares1999-07-20Paper
Asymptotic Enumeration of Eulerian Circuits in the Complete Graph1999-07-07Paper
https://portal.mardi4nfdi.de/entity/Q42501801999-06-17Paper
A note on large graphs of diameter two and given maximum degree1999-04-23Paper
https://portal.mardi4nfdi.de/entity/Q42084271999-04-08Paper
Isomorph-Free Exhaustive Generation1998-04-26Paper
The degree sequence of a random graph. I. The models1998-03-08Paper
The asymptotic number of labeled graphs with \(n\) vertices, \(q\) edges, and no isolated vertices1998-02-23Paper
Maximising the permanent of \((0,1)\)-matrices and the number of extensions of Latin rectangles1998-02-18Paper
https://portal.mardi4nfdi.de/entity/Q43373571998-01-13Paper
https://portal.mardi4nfdi.de/entity/Q43496171997-12-07Paper
https://portal.mardi4nfdi.de/entity/Q46933661997-12-01Paper
Determinants of matrices of the conference type1997-11-21Paper
Subgraph counting identities and Ramsey numbers1997-08-20Paper
Vertex-transitive graphs that are not Cayley graphs. II1997-06-22Paper
NC algorithms for dynamically solving the all pairs shortest paths problem and related problems1997-02-27Paper
https://portal.mardi4nfdi.de/entity/Q52845731997-02-23Paper
https://portal.mardi4nfdi.de/entity/Q48842171996-08-11Paper
The Smallest Cubic Graphs of Girth Nine1996-07-14Paper
Asymptotic enumeration of tournaments with a given score sequence1996-02-26Paper
Latin squares of order 101995-09-11Paper
https://portal.mardi4nfdi.de/entity/Q46974571995-08-27Paper
R(4, 5) = 251995-05-14Paper
There are 526,915,620 nonisomorphic one‐factorizations of K121995-05-04Paper
Linear programming in some Ramsey problems1995-05-03Paper
Multicolored trees in random graphs1994-09-15Paper
https://portal.mardi4nfdi.de/entity/Q42899991994-08-29Paper
On Subgraph Sizes in Random Graphs1994-08-10Paper
https://portal.mardi4nfdi.de/entity/Q31389661993-10-20Paper
https://portal.mardi4nfdi.de/entity/Q40336941993-05-16Paper
https://portal.mardi4nfdi.de/entity/Q40171421993-01-16Paper
Asymptotic properties of labeled connected graphs1992-06-28Paper
The value of the Ramsey numberr(3, 8)1992-06-28Paper
Ralph Gordon Stanton1992-06-28Paper
https://portal.mardi4nfdi.de/entity/Q39832551992-06-27Paper
Asymptotic enumeration by degree sequence of graphs with degrees \(o(n^{1/2})\)1992-06-27Paper
https://portal.mardi4nfdi.de/entity/Q39746921992-06-25Paper
The asymptotic number of labeled connected graphs with a given number of vertices and edges1992-06-25Paper
The exponent set of symmetric primitive (0,1) matrices with zero trace1992-06-25Paper
Asymptotic enumeration by degree sequence of graphs of high degree1992-06-25Paper
Asymptotic enumeration of Latin rectangles1990-01-01Paper
The asymptotic numbers of regular tournaments, Eulerian digraphs and Eulerian oriented graphs1990-01-01Paper
Uniform generation of random regular graphs of moderate degree1990-01-01Paper
On Littlewood's estimate for the binomial distribution1989-01-01Paper
Erratum to: The smallest non-Hamiltonian 3-connected cubic planar graphs have 38 vertices1989-01-01Paper
On the shape of a random acyclic digraph1989-01-01Paper
The smallest non-Hamiltonian 3-connected cubic planar graphs have 38 vertices1988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q30324051988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37864881987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37864981987-01-01Paper
Determinants and ranks of random matrices over \({\mathbb{Z}}_ m\)1987-01-01Paper
Constant Time Generation of Free Trees1986-01-01Paper
The number of matchings in random regular graphs and bipartite graphs1986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37225341986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37316281986-01-01Paper
Hamiltonian cycles in cubic 3-connected bipartite planar graphs1985-01-01Paper
Integer sequences with proscribed differences and bounded growth rate1985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36841471985-01-01Paper
Asymptotic enumeration of Latin rectangles1984-01-01Paper
Automorphisms of random graphs with specified vertices1984-01-01Paper
An algorithm for generating subsets of fixed size with a strong minimal change property1984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33439991984-01-01Paper
Spanning trees in regular graphs1983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33155561983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33442261983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39569791982-01-01Paper
Constructing cospectral graphs1982-01-01Paper
A nine point theorem for 3-connected graphs1982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39328301981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39537941981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47458521981-01-01Paper
The expected eigenvalue distribution of a large regular graph1981-01-01Paper
Spectral conditions for the reconstructibility of a graph1981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36712111981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38857851980-01-01Paper
THE DIMENSION OF A GRAPH1980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39001101980-01-01Paper
Feasibility conditions for the existence of walk-regular graphs1980-01-01Paper
A correction to Colbourn's paper on the complexity of matrix symmetrizability1980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38552151979-01-01Paper
Transitive Graphs With Fewer Than Twenty Vertices1979-01-01Paper
Hadamard equivalence via graph isomorphism1979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38536321978-01-01Paper
A new graph product and its spectrum1978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41825481978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41944771978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41467431977-01-01Paper
Computer reconstruction of small graphs1977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41893131977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41294881976-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41863631976-01-01Paper
Generating Plane Quadrangulations and Symmetry-preserving Operations on MapsN/APaper

Research outcomes over time

This page was built for person: Brendan D. McKay