- A new lower bound based on Gromov's method of selecting heavily covered points2012 | Faculty of Mathematics and Physics
- Non-three-colorable common graphs exist2012 | Faculty of Mathematics and Physics
- Counting flags in triangle-free digraphs2009 | Faculty of Mathematics and Physics
- Upper bounds on the size of 4-and 6-cycle-free subgraphs of the hypercube2014 | Faculty of Mathematics and Physics