I am a fifth year Ph.D. student in the ACO (Algorithms, Combinatorics, and Optimization) program at Carnegie Mellon University.
You may occasionally also see my name written as Mikhail Lavrov. This is still me. Mikhail and I are the same person.
Department of Mathematical Sciences
Carnegie Mellon University
Pittsburgh, PA 15213
Office: Wean Hall 6201
Office hours: Tuesday 12:30–1:30 PM; Thursday 9:30–10:30 AM
I am one of the coaches for the Western Pennsylvania ARML Team, which meets every Sunday from 4 to 7 PM at CMU in Porter Hall A20. To find out more, see either
- M. Lavrov. An upper bound for the Hales-Jewett number HJ(4,2). SIAM Journal on Discrete Mathematics, to appear.
- M. Lavrov and P. Loh. Increasing Hamiltonian paths in random edge orderings. Random Structures and Algorithms, vol. 48, no. 3, 588-611, 2016.
- M. Lavrov, M. Lee, and J. Mackey. Improved upper and lower bounds on a geometric Ramsey problem. European Journal of Combinatorics, vol. 42, 135-144, 2014.
- A. Frieze, S. Haber, and M. Lavrov. On the game chromatic number of sparse random graphs. SIAM Journal on Discrete Mathematics, vol. 27, no. 2, 768-790, 2013.
- M. Lavrov and D. Rutherford. On the S¹ x S² HOMFLY-PT invariant and Legendrian links. Journal of Knot Theory and Its Ramifications, vol. 22, no. 8, 1350040 [21 pages], 2013.
- M. Lavrov and D. Rutherford. Generalized normal rulings and invariants of Legendrian solid torus links. Pacific Journal of Mathematics, vol. 258, no. 2, 393-420, 2012.
Last updated April 6, 2016.
Misha Lavrov <firstname.lastname@example.org>