scientific article; zbMATH DE number 2127722

MaRDI QIDQ3154668zbMATH OpenFDO

Authors Alan Frieze, Boris Pittel

Publication date 14 January 2005

zbMATH Keywords

enumeration of bipartite graphsminimum degree constraintperfect matchingrandom graph

Mathematics Subject Classification ID

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

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
• scientific article; zbMATH DE number 1512672

Cited in

(30)

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

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)