Nina Kamcev

activity

20162022

collaborators

5 papers

math.CO2022

Unavoidable patterns in locally balanced colourings

Nina Kamčev, Alp Müyesser

Which patterns must a two-colouring of $K_{n}$ contain if each vertex has at least $ε n$ red and $ε n$ blue neighbours? In this paper, we investigate this questio…

math.CO2020

Properly colored Hamilton cycles in Dirac-type hypergraphs

Sylwia Antoniuk, Nina Kamčev, Andrzej Ruciński

We consider a robust variant of Dirac-type problems in $k$ -uniform hypergraphs. For instance, we prove that if $H$ is a $k$ -uniform hypergraph with minimum codegree at least $(1/2…

math.CO2019

The size Ramsey number of graphs with bounded treewidth

Nina Kamcev, Anita Liebenau, David R. Wood +1

A graph $G$ is Ramsey for a graph $H$ if every 2-colouring of the edges of $G$ contains a monochromatic copy of $H$ . We consider the following question: if $H$ has bounded treewidt…

math.CO2018

Another Note on Intervals in the Hales-Jewett Theorem

Nina Kamčev, Christoph Spiegel

The Hales-Jewett Theorem states that any $r$ -colouring of $[m]^{n}$ contains a monochromatic combinatorial line if $n$ is large enough. Shelah's proof of the theorem implies that for…

math.CO2016

Anagram-free colorings of graphs

Nina Kamčev, Tomasz Łuczak, Benny Sudakov

A sequence $S$ is called anagram-free if it contains no consecutive symbols $r_{1} r_{2} \dots r_{k} r_{k + 1} \dots r_{2 k}$ such that $r_{k + 1} \dots r_{2 k}$ is a permutation of the block $…