scientific article

zbMath1055.05135MaRDI QIDQ3154668

Boris G. Pittel, Alan M. Frieze

Publication date: 14 January 2005

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

zbMATH Keywords

random graphperfect matchingenumeration of bipartite graphsminimum degree constraint

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (12)

Tight multiple twins in permutations ⋮ New results relating independence and matchings ⋮ Finding maximum matchings in random regular graphs in linear expected time ⋮ A scaling limit for the length of the longest cycle in a sparse random digraph ⋮ Packing tree factors in random and pseudo-random graphs ⋮ Unnamed Item ⋮ Unnamed Item ⋮ A scaling limit for the length of the longest cycle in a sparse random graph ⋮ Perfect matchings in random bipartite graphs with minimal degree at least 2 ⋮ Variations on twins in permutations ⋮ Unnamed Item ⋮ The average number of spanning trees in sparse graphs with given degrees

This page was built for publication: