scientific article; zbMATH DE number 2127722

MaRDI QIDQ3154668zbMATH OpenFDO

Authors Alan Frieze, Boris Pittel

Publication date 14 January 2005

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)

Recommendations

• scientific article; zbMATH DE number 3950585
• Existence of a perfect matching in a random (\(1+e^{-1}\))-out bipartite graph
• Perfect matchings in random subgraphs of regular bipartite graphs
• Maximum matchings in a class of random graphs
• Publication:4508359

Cited in

(25)

• New results relating independence and matchings
• The number of perfect matchings, and the nesting properties, of random regular graphs
• Perfect matchings in random intersection graphs
• Distance-2-matchings of random graphs
• Packing tree factors in random and pseudo-random graphs
• Co-degrees resilience for perfect matchings in random hypergraphs
• Perfect matchings in random subgraphs of regular bipartite graphs
• Perfect matchings in random polyomino chain graphs
• Minimum cost matching in a random graph with random costs
• The average number of spanning trees in sparse graphs with given degrees
• A scaling limit for the length of the longest cycle in a sparse random graph
• Ordered unavoidable sub-structures in matchings and random matchings
• Perfect matchings in random bipartite graphs with minimal degree at least 2
• Small maximal matchings in random graphs.
• scientific article; zbMATH DE number 7771747 (Why is no real title available?)
• Tight multiple twins in permutations
• Finding maximum matchings in random regular graphs in linear expected time
• Variations on twins in permutations
• On weak twins and up-and-down sub-permutations
• scientific article; zbMATH DE number 3308998 (Why is no real title available?)
• Exact matching of random graphs with constant correlation
• Understanding the correlation gap for matchings
• Existence of a perfect matching in a random (\(1+e^{-1}\))-out bipartite graph
• A scaling limit for the length of the longest cycle in a sparse random digraph
• Matching and covering the vertices of a random graph by copies of a given graph

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3154668)