office: Schreiber 313

e-mail: samotij(at)post.tau.ac.il

e-mail: samotij(at)post.tau.ac.il

I am a post-doctoral researcher at the School of Mathematics at Tel Aviv University hosted by Noga Alon, Michael Krivelevich, and Ron Peled. I am also a junior research fellow at Trinity College, Cambridge. My areas of interest include various branches of extremal and probabilistic combinatorics, such as extremal (hyper)graph theory, the theory of random graphs, and Ramsey theory, as well as some topics in additive number theory. I completed my PhD at the University of Illinois at Urbana-Champaign in 2010 under the supervision of Jozsi Balogh. Prior to coming to Urbana-Champaign, I received master's degrees in mathematics and computer science from the Unversity of Wroclaw.

J. Balogh, R. Morris, W. Samotij, and L. Warnke

The typical structure of sparse K_{r+1}-free graphs

submitted : pdf

M. Krivelevich, D. Reichman, and W. Samotij

Expansion in randomly perturbed connected graphs and its consequences

submitted : pdf

R. Peled, W. Samotij, and A. Yehudayoff

Grounded Lipschitz functions on trees are typically flat

Electronic Communications in Probability 18 (2013), A55 : pdf

D. Conlon, W. T. Gowers, W. Samotij, and M. Schacht

On the KŁR conjecture in random graphs

submitted : pdf

M. Krivelevich and W. Samotij

Long paths and cycles in random subgraphs of H-free graphs

submitted : pdf

J. Balogh, R. Morris, and W. Samotij

Independent sets in hypergraphs

submitted : pdf

R. Peled, W. Samotij, and A. Yehudayoff

Lipschitz functions on expanders are typically flat

Combinatorics, Probability and Computing 22 (2013), 566-591 : pdf

N. Alon, J. Balogh, R. Morris, and W. Samotij

A refinement of the Cameron-Erdős conjecture

to appear in the Proceedings of the London Mathematical Society : pdf

N. Alon, J. Balogh, R. Morris, and W. Samotij

Counting sum-free sets in Abelian groups

to appear in the Israel Journal of Mathematics : pdf

Y. Kohayakawa, S. Lee, V. Rödl, and W. Samotij

The number of Sidon sets and the maximum size of Sidon sets contained in a sparse random set of integers

to appear in Random Structures & Algorithms : pdf

W. Samotij

Stability results for random discrete structures

to appear in Random Structures & Algorithms : pdf

M. Krivelevich and W. Samotij

Optimal packings of Hamilton cycles in sparse random graphs

SIAM Journal on Discrete Mathematics 26 (2012), 964-982 : pdf

D. Johannsen, M. Krivelevich, and W. Samotij

Expanders are universal for the class of all spanning trees

Combinatorics, Probability and Computing 22 (2013), 253-281 : pdf

R. Peled and W. Samotij

Odd cutsets and the hard-core model on Z^{d}

to appear in Annales de l'Institut Henri Poincaré, Probabilités et Statistiques : pdf

J. Balogh, R. Morris, and W. Samotij

Random sum-free subsets of Abelian groups

to appear in the Israel Journal of Mathematics : pdf

J. Balogh, C. Lee, and W. Samotij

Corrádi and Hajnal's theorem for sparse random graphs

Combinatorics, Probability and Computing 21 (2012), 23-55 : pdf

J. Balogh and W. Samotij

On the Chvátal-Erdős triangle game

Electronic Journal of Combinatorics 18 (2011), P72 : pdf

C. Lee and W. Samotij

Pancyclic subgraphs of random graphs

Journal of Graph Theory 71 (2012), 142-158 : pdf

J. Balogh, B. Csaba, and W. Samotij

Local resilience of almost spanning trees in random graphs

Random Structures & Algorithms 38 (2011), 121-139 : pdf

J. Balogh and W. Samotij

The number of K_{s,t}-free graphs

Journal of the London Mathematical Society 83 (2011), 368-388 : pdf

J. Balogh, B. Csaba, M. Pei, and W. Samotij

Large bounded degree trees in expanding graphs

Electronic Journal of Combinatorics 17 (2010), R6 : pdf

J. Balogh and W. Samotij

The number of K_{m,m}-free graphs

Combinatorica 31 (2011), 131-150 : pdf

J. Balogh and W. Samotij

Almost all C_{4}-free graphs have fewer than (1-ε)ex(n,C_{4}) edges

SIAM Journal on Discrete Mathematics 24 (2010), 1011-1018 : pdf

N. Alon, J. Balogh, A. Kostochka, and W. Samotij

Sizes of induced subgraphs of Ramsey graphs

Combinatorics, Probability and Computing 18 (2009), 459-476 : pdf

The typical structure of sparse K

submitted : pdf

M. Krivelevich, D. Reichman, and W. Samotij

Expansion in randomly perturbed connected graphs and its consequences

submitted : pdf

R. Peled, W. Samotij, and A. Yehudayoff

Grounded Lipschitz functions on trees are typically flat

Electronic Communications in Probability 18 (2013), A55 : pdf

D. Conlon, W. T. Gowers, W. Samotij, and M. Schacht

On the KŁR conjecture in random graphs

submitted : pdf

M. Krivelevich and W. Samotij

Long paths and cycles in random subgraphs of H-free graphs

submitted : pdf

J. Balogh, R. Morris, and W. Samotij

Independent sets in hypergraphs

submitted : pdf

R. Peled, W. Samotij, and A. Yehudayoff

Lipschitz functions on expanders are typically flat

Combinatorics, Probability and Computing 22 (2013), 566-591 : pdf

N. Alon, J. Balogh, R. Morris, and W. Samotij

A refinement of the Cameron-Erdős conjecture

to appear in the Proceedings of the London Mathematical Society : pdf

N. Alon, J. Balogh, R. Morris, and W. Samotij

Counting sum-free sets in Abelian groups

to appear in the Israel Journal of Mathematics : pdf

Y. Kohayakawa, S. Lee, V. Rödl, and W. Samotij

The number of Sidon sets and the maximum size of Sidon sets contained in a sparse random set of integers

to appear in Random Structures & Algorithms : pdf

W. Samotij

Stability results for random discrete structures

to appear in Random Structures & Algorithms : pdf

M. Krivelevich and W. Samotij

Optimal packings of Hamilton cycles in sparse random graphs

SIAM Journal on Discrete Mathematics 26 (2012), 964-982 : pdf

D. Johannsen, M. Krivelevich, and W. Samotij

Expanders are universal for the class of all spanning trees

Combinatorics, Probability and Computing 22 (2013), 253-281 : pdf

R. Peled and W. Samotij

Odd cutsets and the hard-core model on Z

to appear in Annales de l'Institut Henri Poincaré, Probabilités et Statistiques : pdf

J. Balogh, R. Morris, and W. Samotij

Random sum-free subsets of Abelian groups

to appear in the Israel Journal of Mathematics : pdf

J. Balogh, C. Lee, and W. Samotij

Corrádi and Hajnal's theorem for sparse random graphs

Combinatorics, Probability and Computing 21 (2012), 23-55 : pdf

J. Balogh and W. Samotij

On the Chvátal-Erdős triangle game

Electronic Journal of Combinatorics 18 (2011), P72 : pdf

C. Lee and W. Samotij

Pancyclic subgraphs of random graphs

Journal of Graph Theory 71 (2012), 142-158 : pdf

J. Balogh, B. Csaba, and W. Samotij

Local resilience of almost spanning trees in random graphs

Random Structures & Algorithms 38 (2011), 121-139 : pdf

J. Balogh and W. Samotij

The number of K

Journal of the London Mathematical Society 83 (2011), 368-388 : pdf

J. Balogh, B. Csaba, M. Pei, and W. Samotij

Large bounded degree trees in expanding graphs

Electronic Journal of Combinatorics 17 (2010), R6 : pdf

J. Balogh and W. Samotij

The number of K

Combinatorica 31 (2011), 131-150 : pdf

J. Balogh and W. Samotij

Almost all C

SIAM Journal on Discrete Mathematics 24 (2010), 1011-1018 : pdf

N. Alon, J. Balogh, A. Kostochka, and W. Samotij

Sizes of induced subgraphs of Ramsey graphs

Combinatorics, Probability and Computing 18 (2009), 459-476 : pdf

Post-doc at the School of Mathematical Sciences at Tel Aviv University (2010-2011, 2012-)

Junior Research Fellow at Trinity College, University of Cambridge (2010-)

PhD in Mathematics from the University of Illinois at Urbana-Champaign (2007-2010)

M.Sc. in Mathematics from the University of Wroclaw (2002-2007)

M.Sc. in Computer Science from the University of Wroclaw (2002-2007)

Junior Research Fellow at Trinity College, University of Cambridge (2010-)

PhD in Mathematics from the University of Illinois at Urbana-Champaign (2007-2010)

M.Sc. in Mathematics from the University of Wroclaw (2002-2007)

M.Sc. in Computer Science from the University of Wroclaw (2002-2007)

My flickr page - some photos I have taken since January 2006