Nalazite se na CroRIS probnoj okolini. Ovdje evidentirani podaci neće biti pohranjeni u Informacijskom sustavu znanosti RH. Ako je ovo greška, CroRIS produkcijskoj okolini moguće je pristupi putem poveznice www.croris.hr
Kamčev, Nina; Letzter, Shoham; Pokrovskiy, Alexey
The Turán Density of Tight Cycles in Three-Uniform Hypergraphs // International mathematics research notices, 2024 (2024), 6; 4804-4841. doi: https://doi.org/10.1093/imrn/rnad177
Kamčev, Nina ; Müyesser, Alp
Unavoidable patterns in locally balanced colourings // Combinatorics probability & computing, 32 (2023), 5; 796-808. doi: 10.1017/s0963548323000160
Kamčev, Nina ; Liebenau, Anita ; Morrison, Natasha
Towards a characterization of Sidorenko systems // Quarterly journal of mathematics, 74 (2023), 3; 957, 974. doi: 10.1093/qmath/haad013
Antoniuk, Sylwia ; Kamčev, Nina ; Ruciński, Andrzej
Properly Colored Hamilton Cycles in Dirac-Type Hypergraphs // The Electronic journal of combinatorics, 30 (2023), 1; P1.44, 31. doi: 10.37236/10651
Kamčev, Nina ; Spiegel, Christoph
Another Note on Intervals in the Hales–Jewett Theorem // The Electronic journal of combinatorics, 29 (2022), 1; 62, 18. doi: 10.37236/9400
Kamcev, Nina ; Liebenau, Anita ; Wormald, Nick
Asymptotic Enumeration of Hypergraphs by Degree Sequence Advances in Combinatorics, 1 (2022), 1, 36. doi: 10.19086/aic.32357
Kamcev, Nina ; Liebenau, Anita ; Wood, David R. ; Yepremyan, Liana
The Size Ramsey Number of Graphs with Bounded Treewidth // SIAM journal on discrete mathematics, 35 (2021), 1; 281-293. doi: 10.1137/20m1335790
Kamčev, Nina ; Krivelevich, Michael ; Morrison, Natasha ; Sudakov, Benny
The Kőnig graph process // Random structures & algorithms, 57 (2020), 4; 1272-1302. doi: 10.1002/rsa.20969
Kalinowski, Thomas ; Kamčev, Nina ; Sudakov, Benny
The Zero Forcing Number of Graphs // SIAM journal on discrete mathematics, 33 (2019), 1; 95-115. doi: 10.1137/17m1133051
KAMČEV, NINA ; ŁUCZAK, TOMASZ ; SUDAKOV, BENNY
Anagram-Free Colourings of Graphs // Combinatorics probability & computing, 27 (2017), 4; 623-642. doi: 10.1017/s096354831700027x
