Liana Yepremyan

I am a postdoctoral researcher at University of Oxford, Mathematics department. I work with Peter Keevash. In August 2016 I graduated from McGill University, Computer Science Department. My Ph.D supervisor was Sergey Norin. I was also co-supervised by Hamed Hatami. My main research interests are in Graph Theory and Combinatorics, in particular I am interested in Extremal Combinatorics and Structural Graph Theory. Here is my CV (last updated March 26th, 2016).

Publications

• S. Norin, L. Yepremyan, The Turan Numbers of Extensions, submitted

• Z. Dvorak, L. Yepremyan, Complete graph immersions and minimum degree, submitted

• E. Csoka, I. Lo, S. Norin, H. Wu, L. Yepremyan, The extremal function for disconnected minors, accepted

• S. Norin, L. Yepremyan, The Lagrangian of Intersecting Families, in preparation, 2015+

• Emily A. Marshall, L. Yepremyan, Z. Gaslowitz, The Characterization of planar, 4-connected, K_{2,5}-minor-free graphs, submitted

• S. Norin, L. Yepremyan, Turan Number of Generalized Triangles, accepted

• S. Norin, L. Yepremyan, Sparse Halves in Dense Triangle-free Graphs, Journal of Combinatorial Theory, Series B (2015), pp. 1-25

• S. Norin, L. Yepremyan, Sparse Halves in Dense Triangle-free Graphs (extended abstract), Electronic Notes in Discrete Mathematics,Volume 43, 5 September 2013, pp. 271-278

• P. Petrosyan, H. Khachatrian, L. Yepremyan, H. Tananyan, Interval Edge-Colorings of Graph Products,Proceedings of the CSIT Conference, Yerevan, 2011, pp. 89-92

Contact me