Sizes of Induced Subgraphs of Ramsey Graphs. - Noga Alon; József Balogh; Alexandr V. Kostochka; Wojciech Samotij (Comb. Probab. Comput., 2009)

Large Bounded Degree Trees in Expanding Graphs. - József Balogh; Béla Csaba; Martin Pei; Wojciech Samotij (Electron. J. Comb., 2010)

Almost All C4-Free Graphs Have Fewer than (1-epsilon), ex(n, C4) Edges. - József Balogh; Wojciech Samotij (SIAM J. Discret. Math., 2010)

The number of Km, m-free graphs. - József Balogh; Wojciech Samotij (Comb., 2011)

On the Chvátal-Erdös Triangle Game. - József Balogh; Wojciech Samotij (Electron. J. Comb., 2011)

The number of Ks, t-free graphs. - József Balogh; Wojciech Samotij (J. Lond. Math. Soc., 2011)

Local resilience of almost spanning trees in random graphs. - József Balogh; Béla Csaba; Wojciech Samotij (Random Struct. Algorithms, 2011)

Corrádi and Hajnal's Theorem for Sparse Random Graphs. - József Balogh; Choongbum Lee; Wojciech Samotij (Comb. Probab. Comput., 2012)

Pancyclic subgraphs of random graphs. - Choongbum Lee; Wojciech Samotij (J. Graph Theory, 2012)

Optimal Packings of Hamilton Cycles in Sparse Random Graphs. - Michael Krivelevich; Wojciech Samotij (SIAM J. Discret. Math., 2012)

Expanders Are Universal for the Class of All Spanning Trees. - Daniel Johannsen; Michael Krivelevich; Wojciech Samotij (Comb. Probab. Comput., 2013)

Lipschitz Functions on Expanders are Typically Flat. - Ron Peled; Wojciech Samotij; Amir Yehudayoff (Comb. Probab. Comput., 2013)

Long Paths and Cycles in Random Subgraphs of $ mathcal{H}$-free Graphs. - Michael Krivelevich; Wojciech Samotij (Electron. J. Comb., 2014)

Stability results for random discrete structures. - Wojciech Samotij (Random Struct. Algorithms, 2014)

Counting independent sets in graphs. - Wojciech Samotij (Eur. J. Comb., 2015)

On the number of monotone sequences. - Wojciech Samotij; Benny Sudakov (J. Comb. Theory B, 2015)

The number of Sidon sets and the maximum size of Sidon sets contained in a sparse random set of integers. - Yoshiharu Kohayakawa; Sangjune Lee; Vojtech Rödl; Wojciech Samotij (Random Struct. Algorithms, 2015)

Smoothed Analysis on Connected Graphs. - Michael Krivelevich; Daniel Reichman 001; Wojciech Samotij (SIAM J. Discret. Math., 2015)

On the Number of Bh -Sets. - Domingos Dellamonica Jr.; Yoshiharu Kohayakawa; Sangjune Lee; Vojtech Rödl; Wojciech Samotij (Comb. Probab. Comput., 2016)

The number of B3-sets of a given cardinality. - Domingos Dellamonica Jr.; Yoshiharu Kohayakawa; Sangjune Lee; Vojtech Rödl; Wojciech Samotij (J. Comb. Theory A, 2016)

Packing trees of unbounded degrees in random graphs. - Asaf Ferber; Wojciech Samotij (J. Lond. Math. Soc., 2019)

Towards the Kohayakawa-Kreuter conjecture on asymmetric Ramsey properties. - Frank Mousset; Rajko Nenadov; Wojciech Samotij (Comb. Probab. Comput., 2020)

A generalized Turán problem in random graphs. - Wojciech Samotij; Clara Shikhelman (Random Struct. Algorithms, 2020)

Largest subgraph from a hereditary property in a random graph. - Noga Alon; Michael Krivelevich; Wojciech Samotij (Discret. Math., 2023)

The List-Ramsey threshold for families of graphs. - Eden Kuperwasser; Wojciech Samotij (Comb. Probab. Comput., 2024)

On the typical structure of graphs not containing a fixed vertex-critical subgraph. - Oren Engelberg; Wojciech Samotij; Lutz Warnke (Random Struct. Algorithms, 2024)

Isoperimetry in Product Graphs. - Sahar Diskin; Wojciech Samotij (Electron. J. Comb., 2025)