Dr Nina Kamčev
Nina has worked on problems across probabilistic and extremal combinatorics, with a focus on Ramsey theory. One of her present research interests is enumeration of large discrete structures.
 Kamčev, Nina ; Liebenau, Anita ; Wood, David R. ; Yepremyan, Liana. "The size Ramsey number of graphs with bounded treewidth". Pre-print. 2019. https://arxiv.org/abs/1906.09185
 Kamčev, Nina ; Łuczak, Tomasz ; Sudakov, Benny. "Anagram-Free Colourings of Graphs". In: Combinatorics Probability and Computing. 2018 ; Vol. 27, No. 4. pp. 623-642. https://doi.org/10.1017/S096354831700027X
 Conlon, David ; Kamčev, Nina. "Intervals in the Hales-Jewett theorem". To appear in European Journal of Combinatorics. 2018. https://arxiv.org/abs/1801.08919