| The zero forcing number of graphs T Kalinowski, N Kamcev, B Sudakov SIAM journal on discrete mathematics 33 (1), 95-115, 2019 | 35 | 2019 |
| The size Ramsey number of graphs with bounded treewidth N Kamcev, A Liebenau, DR Wood, L Yepremyan SIAM journal on discrete mathematics 35 (1), 281-293, 2021 | 22 | 2021 |
| Some remarks on rainbow connectivity N Kamčev, M Krivelevich, B Sudakov Journal of Graph Theory 83 (4), 372-383, 2016 | 22 | 2016 |
| Anagram-free colourings of graphs N Kamčev, T Łuczak, B Sudakov Combinatorics, Probability and Computing 27 (4), 623-642, 2018 | 12 | 2018 |
| Towards a characterization of Sidorenko systems N KamČev, A Liebenau, N Morrison The Quarterly Journal of Mathematics 74 (3), 957-974, 2023 | 10 | 2023 |
| Generalised Knight's tours N Kamčev arXiv preprint arXiv:1311.4109, 2013 | 10 | 2013 |
| On uncommon systems of equations N Kamcev, A Liebenau, N Morrison Israel J. Math., to appear, 2021 | 8 | 2021 |
| Intervals in the Hales-Jewett theorem D Conlon, N Kamcev arXiv preprint arXiv:1801.08919, 2018 | 7 | 2018 |
| Bounded colorings of multipartite graphs and hypergraphs N Kamčev, B Sudakov, J Volec European journal of combinatorics 66, 235-249, 2017 | 7 | 2017 |
| The Turán density of tight cycles in three-uniform hypergraphs N Kamčev, S Letzter, A Pokrovskiy International mathematics research notices 2024 (6), 4804-4841, 2024 | 6 | 2024 |
| Unavoidable patterns in locally balanced colourings N Kamčev, A Müyesser Combinatorics, Probability and Computing 32 (5), 796-808, 2023 | 3 | 2023 |
| The Kőnig graph process N Kamčev, M Krivelevich, N Morrison, B Sudakov Random Structures & Algorithms 57 (4), 1272-1302, 2020 | 3 | 2020 |
| Asymptotic enumeration of hypergraphs by degree sequence N Kamčev, A Liebenau, N Wormald arXiv preprint arXiv:2008.07757, 2020 | 3 | 2020 |
| Properly colored Hamilton cycles in Dirac-type hypergraphs S Antoniuk, N Kamčev, A Ruciński arXiv preprint arXiv:2006.16544, 2020 | 3 | 2020 |
| Uncommon Systems of Equations N Kamčev, A Liebenau, N Morrison Extended Abstracts EuroComb 2021: European Conference on Combinatorics …, 2021 | 2 | 2021 |
| Universal lower bound for community structure of sparse graphs V Agdur, N Kamčev, F Skerman arXiv preprint arXiv:2307.07271, 2023 | 1 | 2023 |
| Increasing paths in random temporal graphs N Broutin, N Kamčev, G Lugosi arXiv preprint arXiv:2306.11401, 2023 | 1 | 2023 |
| Canonical colourings in random graphs N Kamčev, M Schacht Procedia Computer Science 223, 5-12, 2023 | 1 | 2023 |
| Another Note on Intervals in the Hales-Jewett Theorem N Kamčev, C Spiegel arXiv preprint arXiv:1811.04628, 2018 | 1 | 2018 |
| When -intersecting hypergraphs admit bounded -strong colourings K Hendrey, F Illingworth, N Kamčev, J Tan arXiv preprint arXiv:2406.13402, 2024 | | 2024 |
Benjamin SudakovETH, Zurich在 math.ethz.ch 的电子邮件经过验证
