
Liana Yepremyan
I am a Ph.D student at McGill University, Computer Science Department. My supervisor is Sergey Norin and cosupervisor is Hamed Hatami. My main research interests are in Graph Theory and Combinatorics, in particular I am interested in Extremal Combinatorics, Probabilistic Method and Structural Graph Theory. Here is my CV (last updated March 26th, 2016). I will be joining Oxford University in the Fall 2016 as a postdoctoral researcher, under the supervision of Peter Keevash.
I am the organizer of DMO seminars at McGill University. If you are interested in giving a talk at McGill, please contact me.
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, submitted
S. Norin, L. Yepremyan, The Lagrangian of Intersecting Families, in preparation, 2015+
Emily A. Marshall,
L. Yepremyan, Z. Gaslowitz, The Characterization of planar, 4connected, K_{2,5}minorfree graphs, submitted
S. Norin, L. Yepremyan, Turan Number of Generalized Triangles, submitted
S. Norin, L. Yepremyan, Sparse Halves in Dense Trianglefree Graphs, Journal of Combinatorial Theory, Series B (2015), pp. 125
S. Norin, L. Yepremyan, Sparse Halves in Dense Trianglefree Graphs (extended abstract), Electronic Notes in Discrete Mathematics,Volume 43, 5 September 2013, pp. 271278
P. Petrosyan, H. Khachatrian, L. Yepremyan, H. Tananyan, Interval EdgeColorings of Graph Products,Proceedings of the CSIT Conference, Yerevan, 2011, pp. 8992
Contact me
McConnell Engineering Bldg, Rm 303
3480 University Street
Montreal, Quebec, Canada
H3A 0E9 email: name.surname@mail.mcgill.ca
 