Perfect matchings in random uniform hypergraphs

DOI10.1002/RSA.10093MaRDI QIDQ4434467zbMATH OpenOpenAlexFDO

Authors Jeong Han Kim

Publication date 10 November 2003

Published in Random Structures \& Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/rsa.10093

Mathematics Subject Classification ID

Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Almost perfect matchings in random uniform hypergraphs
• Perfect matching of 3-uniform hypergraphs
• Perfect matchings in random s‐uniform hypergraphs
• Perfect matchings in large uniform hypergraphs with large minimum collective degree
• Perfect Matchings in Random r-regular, s-uniform Hypergraphs

Cited in

(22)

• Almost perfect matchings in random uniform hypergraphs
• Sandwiching random graphs: universality between random graph models
• Distributed algorithms for matching in hypergraphs
• Co-degrees resilience for perfect matchings in random hypergraphs
• Asymptotics for Shamir's problem
• Perfect matchings in random polyomino chain graphs
• Corrádi and Hajnal's theorem for sparse random graphs
• Perfect matchings via uniform sampling in regular bipartite graphs
• Equivalence of a random intersection graph and G (n ,p )
• scientific article; zbMATH DE number 5720905 (Why is no real title available?)
• Combinatorial and computational aspects of graph packing and graph decomposition
• scientific article; zbMATH DE number 949656 (Why is no real title available?)
• Randomness-Optimal Unique Element Isolation with Applications to Perfect Matching and Related Problems
• Perfect Matchings in Random r-regular, s-uniform Hypergraphs
• Hitting times for Shamir's problem
• Tight minimum degree conditions forcing perfect matchings in uniform hypergraphs
• Tilings in randomly perturbed graphs: Bridging the gap between Hajnal‐Szemerédi and Johansson‐Kahn‐Vu
• Random cliques in random graphs and sharp thresholds for F$$ F $$‐factors
• The hitting time of clique factors
• The hitting time of clique factors (extended abstract)
• Clique factors in pseudorandom graphs
• Increasing the flexibility of the herding attack

This page was built for publication: Perfect matchings in random uniform hypergraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4434467)