Perfect Matchings in Random r-regular, s-uniform Hypergraphs
DOI10.1017/S0963548300001796zbMATH Open0857.05075OpenAlexW2104183200WikidataQ105584964 ScholiaQ105584964MaRDI QIDQ4883058FDOQ4883058
Authors: Colin Cooper, Alan Frieze, Michael Molloy, Bruce Reed 
Publication date: 6 March 1997
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s0963548300001796
Recommendations
Random graphs (graph-theoretic aspects) (05C80) Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
- Perfect matchings in random s‐uniform hypergraphs
- The asymptotic number of labeled graphs with given degree sequences
- Almost all regular graphs are hamiltonian
- On the existence of a factor of degree one of a connected random graph
- Almost all cubic graphs are Hamiltonian
- Tree-Matchings in Graph Processes
- Matching and covering the vertices of a random graph by copies of a given graph
- A threshold for perfect matchings in random d-pure hypergraphs
Cited In (29)
- The cover times of random walks on random uniform hypergraphs
- A threshold result for loose Hamiltonicity in random regular uniform hypergraphs
- Perfect matchings in random uniform hypergraphs
- Isomorphism for random \(k\)-uniform hypergraphs
- Spanning trees in random regular uniform hypergraphs
- SIS epidemic propagation on hypergraphs
- Perfect matchings via uniform sampling in regular bipartite graphs
- Asymptotic enumeration of sparse uniform linear hypergraphs with given degrees
- The number of perfect matchings, and the nesting properties, of random regular graphs
- Satisfiability thresholds for regular occupation problems
- Asymptotic enumeration of sparse uniform hypergraphs with given degrees
- Cores in random hypergraphs and Boolean formulas
- Asymptotic Enumeration of Hypergraphs by Degree Sequence
- Hitting times for Shamir's problem
- Pseudorandom hypergraph matchings
- Title not available (Why is that?)
- Increasing the flexibility of the herding attack
- On regular hypergraphs of high girth
- Enumerating sparse uniform hypergraphs with given degree sequence and forbidden edges
- Rainbow Hamilton cycles in random regular graphs
- Perfect fractional matchings in \(k\)-out hypergraphs
- Identifying defective sets using queries of small size
- Graph factors and factorization: 1985--2003: a survey
- Factors in random graphs
- Asymptotics for Shamir's problem
- The matching process and independent process in random regular graphs and hypergraphs
- Approximate counting of regular hypergraphs
- Smart elements in combinatorial group testing problems with more defectives
- Sampling hypergraphs with given degrees
This page was built for publication: Perfect Matchings in Random r-regular, s-uniform Hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4883058)
