Yingjie Qian 钱莹洁
Contact:
Email: firstname dot lastname
at gatech.edu
Office: Skiles 146A, School of Mathematics, Georgia Tech
About me:
I am a second-year Ph.D. student in the Algorithms,
Combinatorics and Optimization (ACO) program at Georgia Tech. My home department is
Mathematics. I
am fortunate to be advised and mentored by Xingxing Yu, and
am partially supported by ACO fellowship.
Previously, I received my B.A.&Sc. and M.Sc. at McGill University, Canada, where I
was lucky to have Hamed Hatami as my
master supervisor. I also worked with Sergey Norin at McGill.
My research interests are graph theory and combinatorics.
Google Scholar.
Publications:
- (with R. Kapadia, S. Norin) Asymptotic Density of Graphs Excluding Disconnected Minors. [arXiv]
- (with L. Hambardzumyan, H. Hatami) Polynomial method and graph
bootstrap percolation, submitted. [arXiv]
- (with H. Hatami) The Uncounded-Error Communication Complexity of
symmetric XOR functions, submitted. [arXiv]
- (with H. Hatami) Teaching dimension, VC dimension, and critical
sets in Latin squares, Journal of Combinatorics, 9(1):9-20, 2018. [arXiv]
Last updated 08/27/2019