scientific article

zbMath0492.05038MaRDI QIDQ3953794

Brendan D. McKay

Publication date: 1981

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

zbMATH Keywords

spanning treebipartite graphsdegree sequencerandom labelled graph

Mathematics Subject Classification ID

Trees (05C05) Enumeration in graph theory (05C30) Combinatorial probability (60C05)

Related Items (32)

Spanning trees in random regular uniform hypergraphs ⋮ The number of matchings in random regular graphs and bipartite graphs ⋮ Spectral gap in random bipartite biregular graphs and applications ⋮ Asymptotic enumeration of sparse uniform linear hypergraphs with given degrees ⋮ Adjacency matrices of random digraphs: singularity and anti-concentration ⋮ The asymptotic number of labeled graphs with \(n\) vertices, \(q\) edges, and no isolated vertices ⋮ 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 number of perfect matchings, and the nesting properties, of random regular graphs ⋮ Global eigenvalue fluctuations of random biregular bipartite graphs ⋮ Sharp Poincaré and log-Sobolev inequalities for the switch chain on regular bipartite graphs ⋮ Triangles and subgraph probabilities in random regular graphs ⋮ On the second eigenvalue of random bipartite biregular graphs ⋮ The average distance and the diameter of dense random regular graphs ⋮ The length of closed geodesics on random Riemann surfaces ⋮ Induced subgraphs in sparse random graphs with given degree sequences ⋮ On the singularity of adjacency matrices for random regular digraphs ⋮ Anti-concentration property for random digraphs and invertibility of their adjacency matrices ⋮ How to determine if a random graph with a fixed degree sequence has a giant component ⋮ Random dense bipartite graphs and directed graphs with specified degrees ⋮ The rank of random regular digraphs of constant degree ⋮ The Marčenko-Pastur law for sparse random bipartite biregular graphs ⋮ Spectra of random regular hypergraphs ⋮ Expanders with respect to Hadamard spaces and random graphs ⋮ Asymptotic enumeration by degree sequence of graphs of high degree ⋮ Automorphisms of random graphs with specified vertices ⋮ The Tracy-Widom law for some sparse random matrices ⋮ Random regular graphs of non-constant degree: concentration of the chromatic number ⋮ Counting triangles in power-law uniform random graphs ⋮ Sandwiching dense random regular graphs between binomial random graphs ⋮ Spanning trees in regular graphs ⋮ The average number of spanning trees in sparse graphs with given degrees

This page was built for publication: