Perfect Matchings in Random r-regular, s-uniform Hypergraphs

DOI10.1017/S0963548300001796MaRDI QIDQ4883058zbMATH OpenOpenAlexWikidataFDO

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

zbMATH Keywords

random graphpartitionhypergraphsperfect matchingsharp threshold

Mathematics Subject Classification ID

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

Recommendations

• Perfect matchings in random s‐uniform hypergraphs
• Almost perfect matchings in random uniform hypergraphs
• Perfect matchings in random uniform hypergraphs

Cites work

• A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
• A threshold for perfect matchings in random d-pure hypergraphs
• Almost all cubic graphs are Hamiltonian
• Almost all regular graphs are hamiltonian
• Matching and covering the vertices of a random graph by copies of a given graph
• On the existence of a factor of degree one of a connected random graph
• Perfect matchings in random s‐uniform hypergraphs
• The asymptotic number of labeled graphs with given degree sequences
• Tree-Matchings in Graph Processes

Cited in

(29)

• Cores in random hypergraphs and Boolean formulas
• The number of perfect matchings, and the nesting properties, of random regular graphs
• Spanning trees in random regular uniform hypergraphs
• Asymptotic enumeration of sparse uniform hypergraphs with given degrees
• The cover times of random walks on random uniform hypergraphs
• Graph factors and factorization: 1985--2003: a survey
• scientific article; zbMATH DE number 949656 (Why is no real title available?)
• Increasing the flexibility of the herding attack
• Perfect matchings via uniform sampling in regular bipartite graphs
• Smart elements in combinatorial group testing problems with more defectives
• A threshold result for loose Hamiltonicity in random regular uniform hypergraphs
• Hitting times for Shamir's problem
• Perfect matchings in random uniform hypergraphs
• Sampling hypergraphs with given degrees
• Rainbow Hamilton cycles in random regular graphs
• Pseudorandom hypergraph matchings
• Isomorphism for random \(k\)-uniform hypergraphs
• Satisfiability thresholds for regular occupation problems
• SIS epidemic propagation on hypergraphs
• Asymptotic Enumeration of Hypergraphs by Degree Sequence
• On regular hypergraphs of high girth
• Asymptotic enumeration of sparse uniform linear hypergraphs with given degrees
• Asymptotics for Shamir's problem
• Factors in random graphs
• Enumerating sparse uniform hypergraphs with given degree sequence and forbidden edges
• Approximate counting of regular hypergraphs
• The matching process and independent process in random regular graphs and hypergraphs
• Perfect fractional matchings in \(k\)-out hypergraphs
• Identifying defective sets using queries of small size

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)