59 citations · 241 across the 37 of their papers we have counts for
43 papers
Factorisation of the complete graph into spanning regular factors
Mahdieh Hasheminezhad, Brendan D. McKay
We enumerate factorisations of the complete graph into spanning regular graphs in several cases, including when the degrees of all the factors except for one or two are small. The…
Factorisation of the complete bipartite graph into spanning semiregular factors
Mahdieh Hasheminezhad, Brendan D. McKay
We enumerate factorisations of the complete bipartite graph into spanning semiregular graphs in several cases, including when the degrees of all the factors except one or two are s…
Paths through equally spaced points on a circle
Brendan D. McKay, Tim Peters
Consider points evenly spaced on a circle, and a path of chords that uses each point once. There are possible chord lengths, so the path defines a…
Degree sequences of sufficiently dense random uniform hypergraphs
Catherine Greenhill, Mikhail Isaev, Tamás Makai +1
We find an asymptotic enumeration formula for the number of simple -uniform hypergraphs with a given degree sequence, when the number of edges is sufficiently large. The formula…
Enumeration of Latin squares with conjugate symmetry
Brendan D. McKay, Ian M. Wanless
A Latin square has six conjugate Latin squares obtained by uniformly permuting its (row, column, symbol) triples. We say that a Latin square has conjugate symmetry if at least two…
Reconstruction of small graphs and digraphs
Brendan D. McKay
We describe computer searches that prove the graph reconstruction conjecture for graphs with up to 13 vertices and some limited classes on larger sizes. We also investigate the rec…