scientific article

From MaRDI portal
Publication:3343999

zbMath0552.05017MaRDI QIDQ3343999

Brendan D. McKay

Publication date: 1984


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.



Related Items

The number of matchings in random regular graphs and bipartite graphs, Spectral gap in random bipartite biregular graphs and applications, Generalized derivations and additive theory, Efficient importance sampling for binary contingency tables, Mixing time of the switch Markov chain and stable degree sequences, Factorisation of the complete bipartite graph into spanning semiregular factors, Asymptotic enumeration of digraphs and bipartite graphs by degree sequence, On the number of spanning trees in random regular graphs, Subgraph probability of random graphs with specified degrees and applications to chromatic number and connectivity, The switch Markov chain for sampling irregular graphs and digraphs, Asymptotic enumeration of 0-1 matrices with equal row sums and equal column sums, Structure of eigenvectors of random regular digraphs, Sampling hypergraphs with given degrees, Asymptotic enumeration of sparse nonnegative integer matrices with specified row and column sums, Exchangeable pairs, switchings, and random regular graphs, Asymptotic enumeration of Latin rectangles, On dispersable book embeddings, Boolean matrices with prescribed row/column sums and stable homogeneous polynomials: combinatorial and algorithmic applications, Hamilton cycles in random graphs with minimum degree at least 3: An improved analysis, Asymptotic distribution of the numbers of vertices and arcs of the giant strong component in sparse random digraphs, Asymptotic enumeration by degree sequence of graphs of high degree, Asymptotic enumeration of strongly connected digraphs by vertices and edges, Diameter and stationary distribution of random \(r\)-out digraphs, Asymptotic enumeration of sparse 0--1 matrices with irregular row and column sums