64 citations · 171 across the 34 of their papers we have counts for
5 papers · 1 filter
Stability results for random discrete structures
Wojciech Samotij
Two years ago, Conlon and Gowers, and Schacht proved general theorems that allow one to transfer a large class of extremal combinatorial results from the deterministic to the proba…
Optimal packings of Hamilton cycles in sparse random graphs
Michael Krivelevich, Wojciech Samotij
We prove that there exists a positive constant εsuch that if \log n / n \le p \le n^{-1+ε}, then asymptotically almost surely the random graph G ~ G(n,p) contains a collection of \…
Expanders Are Universal for the Class of All Spanning Trees
Daniel Johannsen, Michael Krivelevich, Wojciech Samotij
Given a class of graphs F, we say that a graph G is universal for F, or F-universal, if every H in F is contained in G as a subgraph. The construction of sparse universal graphs fo…
Odd cutsets and the hard-core model on Z^d
Ron Peled, Wojciech Samotij
We consider the hard-core lattice gas model on Z^d and investigate its phase structure in high dimensions. We prove that when the intensity parameter exceeds Cd^{-1/3}(log d)^2, th…
Random sum-free subsets of Abelian groups
József Balogh, Robert Morris, Wojciech Samotij
We characterize the structure of maximum-size sum-free subsets of a random subset of an Abelian group . In particular, we determine the threshold …