Some intersection theorems for ordered sets and graphs
Journal of Combinatorial Theory Series A
Threshold functions for Extension Statements
Journal of Combinatorial Theory Series A
Matching and covering the vertices of a random graph by copies of a given graph
Discrete Mathematics
Perfect matchings in random s-uniform hypergraphs
Random Structures & Algorithms
On the concentration of multivariate polynomials with small expectation
Random Structures & Algorithms
Theory of Information and Coding
Theory of Information and Coding
Information Theory: Coding Theorems for Discrete Memoryless Systems
Information Theory: Coding Theorems for Discrete Memoryless Systems
Concentration of non-Lipschitz functions and applications
Random Structures & Algorithms - Probabilistic methods in combinatorial optimization
Triangle Factors in Random Graphs
Combinatorics, Probability and Computing
Embedding Spanning Trees in Random Graphs
SIAM Journal on Discrete Mathematics
Increasing the flexibility of the herding attack
Information Processing Letters
An improved upper bound on the density of universal random graphs
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
Packing hamilton cycles in random and pseudo-random hypergraphs
Random Structures & Algorithms
SIAM Journal on Discrete Mathematics
| Hi-index | 0.00 |
Let H be a fixed graph on v vertices. For ann-vertex graph G with n divisible by v,an H-factor of G is a collection of n-vcopies of H whose vertex sets partition V(G).In this work, we consider the thresholdthH(n) of the property thatan Erdõs-Rényi random graph (on n points)contains an H-factor. Our results determinethH(n) for all strictlybalanced H.The method here extends with no difficulty to hypergraphs. As acorollary, we obtain the threshold for a perfect matching in randomk-uniform hypergraph, solving the well-known "Shamir'sproblem." © 2008 Wiley Periodicals, Inc. Random Struct. Alg.,2008