scientific article; zbMATH DE number 949656

MaRDI QIDQ4716332zbMATH OpenFDO

Authors Michael Krivelevich

Publication date 15 October 1997

zbMATH Keywords

fractional matchingrandom hypergraph

Mathematics Subject Classification ID

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

Recommendations

• Fractional matchings in hypergraphs
• Perfect fractional matchings in \(k\)-out hypergraphs
• Perfect matchings in random uniform hypergraphs
• Almost perfect matchings in random uniform hypergraphs
• Perfect matchings in random s‐uniform hypergraphs
• Perfect Matchings in Random r-regular, s-uniform Hypergraphs

Cited in

(10)

• Almost perfect matchings in random uniform hypergraphs
• Thresholds versus fractional expectation-thresholds
• Co-degrees resilience for perfect matchings in random hypergraphs
• Perfect fractional matchings in \(k\)-out hypergraphs
• Asymptotics for Shamir's problem
• Perfect matchings in random s‐uniform hypergraphs
• Hitting times for Shamir's problem
• On the threshold problem for Latin boxes
• Near-perfect clique-factors in sparse pseudorandom graphs
• Clique factors in pseudorandom graphs

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 Q4716332)