Nina Kamcev

According to our database, Nina Kamcev authored at least 15 papers between 2014 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2023

Unavoidable patterns in locally balanced colourings.

Nina Kamcev, Alp Müyesser

Comb. Probab. Comput., September, 2023

Universal lower bound for community structure of sparse graphs.

Vilhelm Agdur, Nina Kamcev, Fiona Skerman

CoRR, 2023

Increasing paths in random temporal graphs.

Nicolas Broutin, Nina Kamcev, Gábor Lugosi

CoRR, 2023

Properly Colored Hamilton Cycles in Dirac-Type Hypergraphs.

Sylwia Antoniuk, Nina Kamcev, Andrzej Rucinski

Electron. J. Comb., 2023

Canonical colourings in random graphs.

Nina Kamcev, Mathias Schacht

Proceedings of the XII Latin-American Algorithms, Graphs and Optimization Symposium, 2023

2022

Another Note on Intervals in the Hales-Jewett Theorem.

Nina Kamcev, Christoph Spiegel

Electron. J. Comb., 2022

2021

The Size Ramsey Number of Graphs with Bounded Treewidth.

Nina Kamcev, Anita Liebenau, David R. Wood, Liana Yepremyan

SIAM J. Discret. Math., 2021

2020

The Kőnig graph process.

Nina Kamcev, Michael Krivelevich, Natasha Morrison, Benny Sudakov

Random Struct. Algorithms, 2020

2019

The Zero Forcing Number of Graphs.

Thomas Kalinowski, Nina Kamcev, Benny Sudakov

SIAM J. Discret. Math., 2019

The size Ramsey number of graphs with bounded treewidth.

Nina Kamcev, Anita Liebenau, David Wood, Liana Yepremyan

CoRR, 2019

2018

Anagram-Free Colourings of Graphs.

Nina Kamcev, Tomasz Luczak, Benny Sudakov

Comb. Probab. Comput., 2018

2017

Anagram-free colorings of graphs.

Nina Kamcev, Tomasz Luczak, Benny Sudakov

Electron. Notes Discret. Math., 2017

Bounded colorings of multipartite graphs and hypergraphs.

Nina Kamcev, Benny Sudakov, Jan Volec

Eur. J. Comb., 2017

2015

Some Remarks on Rainbow Connectivity.

Nina Kamcev, Michael Krivelevich, Benny Sudakov

Electron. Notes Discret. Math., 2015

2014

Generalised Knight's Tours.

Nina Kamcev

Electron. J. Comb., 2014