A threshold for perfect matchings in random d-pure hypergraphs

DOI10.1016/0012-365X(83)90044-4zbMath0512.05047OpenAlexW1963909248MaRDI QIDQ1839262

Eli Shamir, Jeanette P. Schmidt

Publication date: 1983

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(83)90044-4

zbMATH Keywords

perfect matchingrandom hypergraphd-partite hypergraph

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Hypergraphs (05C65) Zero-one laws (60F20)

Related Items (10)

Networks beyond pairwise interactions: structure and dynamics ⋮ Probabilistic analysis of strong hypergraph coloring algorithms and the strong chromatic number ⋮ Almost perfect matchings in random uniform hypergraphs ⋮ Random cliques in random graphs and sharp thresholds for F$$ F $$‐factors ⋮ Threshold for Steiner triple systems ⋮ Asymptotics for Shamir's problem ⋮ Perfect Matchings in Random r-regular, s-uniform Hypergraphs ⋮ Increasing the flexibility of the herding attack ⋮ Component structure in the evolution of random hypergraphs ⋮ Hitting times for Shamir’s problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fast probabilistic algorithms for Hamiltonian circuits and matchings
• On the combinatorial problems which I would most like to see solved
• One-factor in random graphs based on vertex choice

This page was built for publication: A threshold for perfect matchings in random d-pure hypergraphs