Nina Kamčev

University of Zagreb

nina.kamcev at math.hr

Hello! I am a research fellow at the University of Zagreb (supported by the EU's Widening Fellowship), working in extremal and probabilistic combinatorics. I completed my PhD at ETH Zurich in 2018 under the supervision of Benny Sudakov. From 2018 until 2021 I was a Research Fellow at Monash University.

Topics I have recently worked on include asymptotic enumeration, graph Ramsey theory, arithmetic Ramsey theory, extremal problem for hypergraphs, random and pseudorandom graphs. I love hearing about new problems and applying techinques from e.g. algebra and probability, so feel free to contact me on nina.kamcev at math.hr.

Here are some resources for master's thesis writing.

Among my `softer' academic interests are mentoring and leadership in research, sustainability, including women and minority groups, returning to Croatia, education vs. training, why and how fundamental science is worth pursuing. I would particularly like to participate in improving the quality of teaching and research in Zagreb, and opening new opportunities for students, but I am not claiming to have any authority there. I'd be very happy to exchange on any of those topics! When nothing else remains, there is music and dancing :)


*This website is in construction and probably always will be. Suggestions are very welcome!Photo credit: Liana Yepremyan
  1. Kolika je šansa da svih 600 vozača bacanjem kockice dobije 1?

Šansa (ili formalno vjerojatnost) je 600-struki umnožak 1/6 * 1/6 * ... * 1/6. Znači, da bi svi vozači dobili 1, morali bismo (u očekivanju) eksperiment ponoviti 10^450 puta. Ispis tog broja je 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000 😊

  1. Ukoliko imamo 12 mostova, kako bismo osigurali jednoliku raspodjelu automobila?

    • Moramo naći način da jedan vozač „izvuče“ slučajan broj između 1 i 12. To se može primjerice uz pomoć 12 karata, ili 12 loto kuglica, ili uz pomoć računala (pokušajte upisati u google "random number from 1 to 12"). Ako svih 600 vozača odabere nasumični most na taj način, dobit ćemo otprilike jednoliku raspodjelu.

    • Usput, jedno rješenje koje se nameće je da vozač baci dvije kockice i odabere njihov zbroj. No, taj način nije „jednolik“ jer, primjerice, nijedan vozač ne može dobiti 1.

  1. Kolika je plava površina ispod krivulje u videu?

    • Krivulja je simetrična, pa je plava površina ispod krivulje jednaka bijeloj površini iznad krivulje. Ta površina iznosi 50cm^2.

  1. Postoji li skup od devet karata bez tablić trojki?

    • Postoji, primjerice 8, 9, 10,...16.


Upcoming talks & activities

  • HMD research colloquium in Zagreb, 23 November, 2022, Turan-type problems for hypergraphs. All are welcome, in particular, English speakers!

  • Od studenoga 2022. podučavat ću Ramseyevu i ergodsku teoriju s Rudijem Mrazovićem. Trenutna verzija skripte se nalazi ovdje. Svi sudionici (primjerice studenti na diplomskom) su dobrodošli, i možete pohađati samo dio predavanja.
    (From November 2022 I will be teaching a doctoral course on Ramsey and Ergodic Theory, with Rudi Mrazović.)

  • Faculty of Science Open Day. You can watch our videos (in Croatian) here.

Talks (2020 onwards)

Outreach activities etc.


Publications

[see ArXiv for up to date PDFs]

Submitted

N. Kamčev, A. Liebenau and N. Morrison, On uncommon systems of equations. (See also the extended abstract from Eurocomb 2021.)

N. Kamčev, A. Liebenau and N. Morrison, Towards a characterisation of Sidorenko systems.

S. Antoniuk, N. Kamčev and A. Ruciński, Properly colored Hamilton cycles in Dirac-type hypergraphs, submitted.


Accepted or published

N. Kamčev and C. Spiegel, Another note on intervals in the Hales-Jewett theorem, The Electronic Journal of Combinatorics. Talk video.

N. Kamčev, A. Liebenau and N. Wormald, Asymptotic enumeration of hypergraphs by degree sequence, Advances in Combinatorics. Talk video.

N. Kamčev, A. Liebenau, D. Wood and L. Yepremyan, The size Ramsey number of graphs with bounded treewidth, SIAM Journal of Discrete Mathematics. Tutorial slides and video.

N. Kamčev, M. Krivelevich, N. Morrison and B. Sudakov, The Kőnig graph process, Random Structures & Algorithms.

D. Conlon and N. Kamčev, Intervals in the Hales-Jewett theorem, to appear in European Journal of Combinatorics.

T. Kalinowski, N. Kamčev and B. Sudakov, Zero forcing number of graphs, SIAM Journal of Discrete Mathematics 33-1 (2018), 95–115.

N. Kamčev, T. Łuczak and B. Sudakov, Anagram-free colourings of graphs, Combinatorics, Probability and Computing (2017), 1–20.

N. Kamčev, B. Sudakov and J. Volec, Bounded colorings of multipartite graphs and hypergraphs, European Journal of Combinatorics 66 (2017), 235–249.

N. Kamčev, M. Krivelevich and B. Sudakov, Some remarks on rainbow connectivity, Journal of Graph Theory 83(4) (2015), 372–383.

N. Kamčev, Generalised knight’s tours, The Electronic Journal of Combinatorics 21 (1) (2014), #P1.31.