Asymptotic enumeration of symmetric integer matrices with uniform row sums

Abstract We investigate the number of symmetric matrices of nonnegative integers with zero diagonal such that each row sum is the same. Equivalently, these are zero-diagonal symmetric contingency tables with uniform margins, or loop-free regular multigraphs. We determine the asymptotic value of this number as the size of the matrix tends to infinity, provided the row sum is large enough. We conjecture that one form of our answer is valid for all row sums. An example appears in Figure 1.