scientific article; zbMATH DE number 2127722
From MaRDI portal
Publication:3154668
zbMATH Open1055.05135MaRDI QIDQ3154668FDOQ3154668
Authors: Alan Frieze, Boris Pittel
Publication date: 14 January 2005
Title of this publication is not available (Why is that?)
Recommendations
Random graphs (graph-theoretic aspects) (05C80) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cited In (26)
- Tight multiple twins in permutations
- 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
- Understanding the correlation gap for matchings
- The average number of spanning trees in sparse graphs with given degrees
- Existence of a perfect matching in a random (\(1+e^{-1}\))-out bipartite graph
- Packing tree factors in random and pseudo-random graphs
- Perfect matchings in random subgraphs of regular bipartite graphs
- Towards optimal degree-distributions for left-perfect matchings in random bipartite graphs
- Perfect matchings in random polyomino chain graphs
- Variations on twins in permutations
- Perfect matchings in random bipartite graphs with minimal degree at least 2
- Title not available (Why is that?)
- Co-degrees resilience for perfect matchings in random hypergraphs
- Perfect matchings in random intersection graphs
- On weak twins and up-and-down sub-permutations
- The number of perfect matchings, and the nesting properties, of random regular graphs
- Matching and covering the vertices of a random graph by copies of a given graph
- A scaling limit for the length of the longest cycle in a sparse random graph
- Minimum cost matching in a random graph with random costs
- Ordered unavoidable sub-structures in matchings and random matchings
- Small maximal matchings in random graphs.
- New results relating independence and matchings
- Distance-2-matchings of random graphs
- Title not available (Why is that?)
- Exact matching of random graphs with constant correlation
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)