Nina Kamcev

Miss

20142019
If you made any changes in Pure these will be visible here soon.

Personal profile

Research interests

Nina has worked on problems across probabilistic and extremal combinatorics, including Ramsey theory, properties of random and pseudorandom graphs, random graph processes and connections to algebraic combinatorics. One of her present research interests is enumeration of large discrete structures.

Biography

She has done her PhD at ETH Zurich under the supervision of Benny Sudakov and her master's degree at the University of Cambridge. At the moment she is working as a research fellow with Anita Liebenau and Nick Wormald.

Network Recent external collaboration on country level. Dive into details by clicking on the dots.

Research Output 2014 2019

The zero forcing number of graphs

Kalinowski, T., Kamcev, N. & Sudakov, B., 1 Jan 2019, In : SIAM Journal on Discrete Mathematics. 33, 1, p. 95-115 21 p.

Research output: Contribution to journalArticleResearchpeer-review

Anagram-Free Colourings of Graphs

Kamčev, N., Łuczak, T. & Sudakov, B., 1 Jul 2018, In : Combinatorics Probability and Computing. 27, 4, p. 623-642 20 p.

Research output: Contribution to journalArticleResearchpeer-review

Open Access
File

Anagram-free colorings of graphs

Kamčev, N., Łuczak, T. & Sudakov, B., 1 Aug 2017, In : Electronic Notes in Discrete Mathematics. 61, p. 671-677 7 p.

Research output: Contribution to journalArticleResearchpeer-review

Bounded colorings of multipartite graphs and hypergraphs

Kamčev, N., Sudakov, B. & Volec, J., 1 Dec 2017, In : European Journal of Combinatorics. 66, p. 235-249 15 p.

Research output: Contribution to journalArticleResearchpeer-review

Some Remarks on Rainbow Connectivity

Kamčev, N., Krivelevich, M. & Sudakov, B., 1 Dec 2016, In : Journal of Graph Theory. 83, 4, p. 372-383 12 p.

Research output: Contribution to journalArticleResearchpeer-review