Michał Przykucki

PhD (Cambridge), MASt, MSc

Departmental Lecturer in Combinatorics at the Mathematical Institute
Postdoctoral Research Fellow and Stipendiary Lecturer in Mathematics at St Anne's College

Research interests: Extremal and probabilistic combinatorics, Percolation, Probability, Graph Theory

I received my Ph.D. from the University of Cambridge in 2013, where I worked under the supervision of Prof. Béla Bollobás. And here is my CV.

I am an Associate Fellow of the Higher Education Academy.

Phone (Institute): 01865 615167
Email: lastname at maths.ox.ac.uk


12.  Parking on a random tree, submitted (with Christina Goldschmidt)
11.  On the purity of minor-closed classes of graphs, submitted (with Colin McDiarmid)
10.  On the maximum running time in graph bootstrap percolationThe Electronic Journal of Combinatorics 24 (2017), 1-20 (with Béla Bollobás, Oliver Riordan and Julian Sahasrabudhe)
9.  The time of graph bootstrap percolation, Random Structures and Algorithms 51 (2017), 143-168 (with Karen Gunderson and Sebastian Koch)
8.  Subcritical U-bootstrap percolation models have non-trivial phase transitions, Transactions of the American Mathematical Society 368 (2016), 7385-7411 (with Paul Balister, Béla Bollobás and Paul Smith)
7.  Maximum percolation time in two-dimensional bootstrap percolationSIAM Journal on Discrete Mathematics (SIDMA) 29 (2015), 224-251 (with Fabricio Benevides)
6.  Lower bounds for bootstrap percolation on Galton-Watson trees, The Electronic Communications in Probability 19 (2014), 1-7 (with Karen Gunderson)
5.  Bootstrap percolation on Galton-Watson trees, The Electronic Journal of Probability 19 (2014), 1-27 (with Béla Bollobás, Karen Gunderson, Cecilia Holmgren and Svante Janson)
4.  On slowly percolating sets of minimal size in bootstrap percolationThe Electronic Journal of Combinatorics 20 (2013), 1-20 (with Fabricio Benevides)
3.  Maximal percolation time in hypercubes under 2-bootstrap percolation, The Electronic Journal of Combinatorics 19 (2012), 1-13
2.  Optimal stopping in a search for a vertex with full degree in a random graph, Discrete Applied Mathematics 160 (2012), 339-343 (with Małgorzata Sulkowska)
1.  Gusein-Zade problem for directed path, Discrete Optimization 7 (2010), 13-20 (with Małgorzata Sulkowska)

Computer Science

3.  Practical Universal Random Sampling, Lecture Notes in Computer Science 6434 (2010), 84-100 (with Marek Klonowski, Tomasz Strumiński and Małgorzata Sulkowska)
2.  Data Deletion with Time–Aware Adversary Model, In proceedings of CSE'09 2 (2009), 659-664 (with Marek Klonowski and Tomasz Strumiński)
1.  Data Deletion with Provable Security, Lecture Notes in Computer Science 5379 (2008), 240-255 (with Marek Klonowski and Tomasz Strumiński)


In MT17 I am lecturing C8.3 Combinatorics. At St Anne's, I am tutoring Introduction to University Mathematics, M1: Linear Algebra I, and A8: Probability.