Wojciech Samotij

Publication Activity (10 Years)

Years Active: 2009-2023
Publications (10 Years): 6

Top Topics

Attribute Value Pairs

Graph Theoretic

Top Venues

Comb. Probab. Comput.

Random Struct. Algorithms

Electron. J. Comb.

Publications

Noga Alon, Michael Krivelevich, Wojciech Samotij
Largest subgraph from a hereditary property in a random graph. Discret. Math. 346 (9) (2023)
Wojciech Samotij, Clara Shikhelman
A generalized Turán problem in random graphs. Random Struct. Algorithms 56 (2) (2020)
Frank Mousset, Rajko Nenadov, Wojciech Samotij
Towards the Kohayakawa-Kreuter conjecture on asymmetric Ramsey properties. Comb. Probab. Comput. 29 (6) (2020)
Asaf Ferber, Wojciech Samotij
Packing trees of unbounded degrees in random graphs. J. Lond. Math. Soc. 99 (3) (2019)
Domingos Dellamonica Jr., Yoshiharu Kohayakawa, Sangjune Lee, Vojtech Rödl, Wojciech Samotij
-sets of a given cardinality. J. Comb. Theory, Ser. A 142 (2016)
Domingos Dellamonica Jr., Yoshiharu Kohayakawa, Sangjune Lee, Vojtech Rödl, Wojciech Samotij
-Sets. Comb. Probab. Comput. 25 (1) (2016)
Yoshiharu Kohayakawa, Sangjune Lee, Vojtech Rödl, Wojciech Samotij
The number of Sidon sets and the maximum size of Sidon sets contained in a sparse random set of integers. Random Struct. Algorithms 46 (1) (2015)
Wojciech Samotij, Benny Sudakov
On the number of monotone sequences. J. Comb. Theory, Ser. B 115 (2015)
Wojciech Samotij
Counting independent sets in graphs. Eur. J. Comb. 48 (2015)
Michael Krivelevich, Daniel Reichman, Wojciech Samotij
Smoothed Analysis on Connected Graphs. SIAM J. Discret. Math. 29 (3) (2015)
Michael Krivelevich, Wojciech Samotij
Long Paths and Cycles in Random Subgraphs of $\mathcal{H}$-free Graphs. Electron. J. Comb. 21 (1) (2014)
Michael Krivelevich, Daniel Reichman, Wojciech Samotij
Smoothed Analysis on Connected Graphs. APPROX-RANDOM (2014)
Wojciech Samotij
Stability results for random discrete structures. Random Struct. Algorithms 44 (3) (2014)
Daniel Johannsen, Michael Krivelevich, Wojciech Samotij
Expanders Are Universal for the Class of All Spanning Trees. Comb. Probab. Comput. 22 (2) (2013)
Ron Peled, Wojciech Samotij, Amir Yehudayoff
Lipschitz Functions on Expanders are Typically Flat. Comb. Probab. Comput. 22 (4) (2013)
Daniel Johannsen, Michael Krivelevich, Wojciech Samotij
Expanders are universal for the class of all spanning trees. SODA (2012)
Choongbum Lee, Wojciech Samotij
Pancyclic subgraphs of random graphs. J. Graph Theory 71 (2) (2012)
Michael Krivelevich, Wojciech Samotij
Optimal Packings of Hamilton Cycles in Sparse Random Graphs. SIAM J. Discret. Math. 26 (3) (2012)
József Balogh, Choongbum Lee, Wojciech Samotij
Corrádi and Hajnal's Theorem for Sparse Random Graphs. Comb. Probab. Comput. 21 (1-2) (2012)
József Balogh, Wojciech Samotij
-free graphs. J. Lond. Math. Soc. 83 (2) (2011)
József Balogh, Béla Csaba, Wojciech Samotij
Local resilience of almost spanning trees in random graphs. Random Struct. Algorithms 38 (1-2) (2011)
József Balogh, Wojciech Samotij
On the Chvátal-Erdös Triangle Game. Electron. J. Comb. 18 (1) (2011)
József Balogh, Wojciech Samotij
-free graphs. Comb. 31 (2) (2011)
József Balogh, Béla Csaba, Martin Pei, Wojciech Samotij
Large Bounded Degree Trees in Expanding Graphs. Electron. J. Comb. 17 (1) (2010)
József Balogh, Wojciech Samotij
) Edges. SIAM J. Discret. Math. 24 (3) (2010)
Noga Alon, József Balogh, Alexandr V. Kostochka, Wojciech Samotij
Sizes of Induced Subgraphs of Ramsey Graphs. Comb. Probab. Comput. 18 (4) (2009)