59 citations · 241 across the 37 of their papers we have counts for
4 papers · 1 filter
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…
The Minimality of the Georges-Kelmans Graph
Gunnar Brinkmann, Jan Goedgebeur, Brendan D. McKay
In 1971, Tutte wrote in an article that "it is tempting to conjecture that every 3-connected bipartite cubic graph is hamiltonian". Motivated by this remark, Horton constructed a c…