# Wojciech Samotij

According to our database1, Wojciech Samotij authored at least 20 papers between 2009 and 2016.

Collaborative distances:
• Dijkstra number2 of four.
• Erdős number3 of two.

Book
In proceedings
Article
PhD thesis
Other

## Bibliography

2016
The number of B3-sets of a given cardinality.
J. Comb. Theory, Ser. A, 2016

On the Number of Bh -Sets.
Combinatorics, Probability & Computing, 2016

2015
The number of Sidon sets and the maximum size of Sidon sets contained in a sparse random set of integers.
Random Struct. Algorithms, 2015

On the number of monotone sequences.
J. Comb. Theory, Ser. B, 2015

Counting independent sets in graphs.
Eur. J. Comb., 2015

2014
Stability results for random discrete structures.
Random Struct. Algorithms, 2014

Long Paths and Cycles in Random Subgraphs of $\mathcal{H}$-free Graphs.
Electr. J. Comb., 2014

Smoothed Analysis on Connected Graphs.
Proceedings of the Approximation, 2014

2013
Lipschitz Functions on Expanders are Typically Flat.
Combinatorics, Probability & Computing, 2013

2012
Optimal Packings of Hamilton Cycles in Sparse Random Graphs.
SIAM J. Discrete Math., 2012

Pancyclic subgraphs of random graphs.
Journal of Graph Theory, 2012

Corrádi and Hajnal's Theorem for Sparse Random Graphs.
Combinatorics, Probability & Computing, 2012

Expanders are universal for the class of all spanning trees.
Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012

2011
Local resilience of almost spanning trees in random graphs.
Random Struct. Algorithms, 2011

The number of Ks, t-free graphs.
J. London Math. Society, 2011

On the Chvátal-Erdös Triangle Game.
Electr. J. Comb., 2011

The number of Km, m-free graphs.
Combinatorica, 2011

2010
Almost All C4-Free Graphs Have Fewer than (1-epsilon), ex(n, C4) Edges.
SIAM J. Discrete Math., 2010

Large Bounded Degree Trees in Expanding Graphs.
Electr. J. Comb., 2010

2009
Sizes of Induced Subgraphs of Ramsey Graphs.
Combinatorics, Probability & Computing, 2009