Wojciech Samotij

According to our database, Wojciech Samotij authored at least 27 papers between 2009 and 2025.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of two.

2025

Isoperimetry in Product Graphs.

Sahar Diskin, Wojciech Samotij

Electron. J. Comb., 2025

2024

On the typical structure of graphs not containing a fixed vertex-critical subgraph.

Oren Engelberg, Wojciech Samotij, Lutz Warnke

Random Struct. Algorithms, 2024

The List-Ramsey threshold for families of graphs.

Eden Kuperwasser, Wojciech Samotij

Comb. Probab. Comput., 2024

2023

Largest subgraph from a hereditary property in a random graph.

Noga Alon, Michael Krivelevich, Wojciech Samotij

Discret. Math., September, 2023

2020

A generalized Turán problem in random graphs.

Wojciech Samotij, Clara Shikhelman

Random Struct. Algorithms, 2020

Towards the Kohayakawa-Kreuter conjecture on asymmetric Ramsey properties.

Frank Mousset, Rajko Nenadov, Wojciech Samotij

Comb. Probab. Comput., 2020

2019

Packing trees of unbounded degrees in random graphs.

Asaf Ferber, Wojciech Samotij

J. Lond. Math. Soc., 2019

2016

The number of B₃-sets of a given cardinality.

Domingos Dellamonica Jr., Yoshiharu Kohayakawa, Sangjune Lee, Vojtech Rödl, Wojciech Samotij

J. Comb. Theory A, 2016

On the Number of <i>B_h </i>-Sets.

Domingos Dellamonica Jr., Yoshiharu Kohayakawa, Sangjune Lee, Vojtech Rödl, Wojciech Samotij

Comb. Probab. Comput., 2016

2015

Smoothed Analysis on Connected Graphs.

Michael Krivelevich, Daniel Reichman, Wojciech Samotij

SIAM J. Discret. Math., 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

On the number of monotone sequences.

Wojciech Samotij, Benny Sudakov

J. Comb. Theory B, 2015

Counting independent sets in graphs.

Wojciech Samotij

Eur. J. Comb., 2015

2014

Stability results for random discrete structures.

Wojciech Samotij

Random Struct. Algorithms, 2014

Long Paths and Cycles in Random Subgraphs of $\mathcal{H}$-free Graphs.

Michael Krivelevich, Wojciech Samotij

Electron. J. Comb., 2014

2013

Lipschitz Functions on Expanders are Typically Flat.

Ron Peled, Wojciech Samotij, Amir Yehudayoff

Comb. Probab. Comput., 2013

Expanders Are Universal for the Class of All Spanning Trees.

Daniel Johannsen, Michael Krivelevich, Wojciech Samotij

Comb. Probab. Comput., 2013

2012

Optimal Packings of Hamilton Cycles in Sparse Random Graphs.

Michael Krivelevich, Wojciech Samotij

SIAM J. Discret. Math., 2012

Pancyclic subgraphs of random graphs.

Choongbum Lee, Wojciech Samotij

J. Graph Theory, 2012

Corrádi and Hajnal's Theorem for Sparse Random Graphs.

József Balogh, Choongbum Lee, Wojciech Samotij

Comb. Probab. Comput., 2012

2011

Local resilience of almost spanning trees in random graphs.

József Balogh, Béla Csaba, Wojciech Samotij

Random Struct. Algorithms, 2011

The number of <i>K</i>_{<i>s, t</i>}-free graphs.

József Balogh, Wojciech Samotij

J. Lond. Math. Soc., 2011

On the Chvátal-Erdös Triangle Game.

József Balogh, Wojciech Samotij

Electron. J. Comb., 2011

The number of <i>K</i>_{<i>m, m</i>}-free graphs.

József Balogh, Wojciech Samotij

Comb., 2011

2010

Almost All C₄-Free Graphs Have Fewer than (1-epsilon), ex(n, C₄) Edges.

József Balogh, Wojciech Samotij

SIAM J. Discret. Math., 2010

Large Bounded Degree Trees in Expanding Graphs.

József Balogh, Béla Csaba, Martin Pei, Wojciech Samotij

Electron. J. Comb., 2010

2009

Sizes of Induced Subgraphs of Ramsey Graphs.

Noga Alon, József Balogh, Alexandr V. Kostochka, Wojciech Samotij

Comb. Probab. Comput., 2009