Perfect Matchings in Random r-regular, s-uniform Hypergraphs
From MaRDI portal
Publication:4883058
DOI10.1017/S0963548300001796zbMath0857.05075OpenAlexW2104183200WikidataQ105584964 ScholiaQ105584964MaRDI QIDQ4883058
Colin Cooper, Michael S. O. Molloy, Alan M. Frieze, Bruce A. 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
Random graphs (graph-theoretic aspects) (05C80) Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items
Spanning trees in random regular uniform hypergraphs, SIS epidemic propagation on hypergraphs, Asymptotic enumeration of sparse uniform linear hypergraphs with given degrees, Cores in random hypergraphs and Boolean formulas, Graph factors and factorization: 1985--2003: a survey, Perfect fractional matchings in \(k\)-out hypergraphs, Identifying defective sets using queries of small size, The cover times of random walks on random uniform hypergraphs, On regular hypergraphs of high girth, Factors in random graphs, Smart elements in combinatorial group testing problems with more defectives, Asymptotics for Shamir's problem, Enumerating sparse uniform hypergraphs with given degree sequence and forbidden edges, Approximate counting of regular hypergraphs, Isomorphism for random \(k\)-uniform hypergraphs, Sampling hypergraphs with given degrees, Asymptotic enumeration of sparse uniform hypergraphs with given degrees, A threshold result for loose Hamiltonicity in random regular uniform hypergraphs, Unnamed Item, Increasing the flexibility of the herding attack, Pseudorandom hypergraph matchings, Rainbow Hamilton cycles in random regular graphs, Hitting times for Shamir’s problem, The matching process and independent process in random regular graphs and hypergraphs, Asymptotic Enumeration of Hypergraphs by Degree Sequence
Cites Work
- A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
- Matching and covering the vertices of a random graph by copies of a given graph
- The asymptotic number of labeled graphs with given degree sequences
- A threshold for perfect matchings in random d-pure hypergraphs
- Tree-Matchings in Graph Processes
- Almost all cubic graphs are Hamiltonian
- Almost all regular graphs are hamiltonian
- Perfect matchings in random s‐uniform hypergraphs
- On the existence of a factor of degree one of a connected random graph
