Perfect matchings in random uniform hypergraphs
From MaRDI portal
Publication:4434467
DOI10.1002/rsa.10093zbMath1028.05088MaRDI QIDQ4434467
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
05C65: Hypergraphs
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
Related Items
Hitting times for Shamir’s problem, 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, Combinatorial and computational aspects of graph packing and graph decomposition, Increasing the flexibility of the herding attack, Sandwiching random graphs: universality between random graph models, Distributed algorithms for matching in hypergraphs, Asymptotics for Shamir's problem, Corrádi and Hajnal's Theorem for Sparse Random Graphs, Equivalence of a random intersection graph and G (n ,p )