Nina Kamcev

activity

20152026

most citedSome Remarks on Rainbow Connectivity

12 citations · 15 across the 9 of their papers we have counts for

collaborators

Showing 2016Show all

2 papers · 1 filter

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 $…

math.CO2016

Bounded colorings of multipartite graphs and hypergraphs

Nina Kamčev, Benny Sudakov, Jan Volec

Let $c$ be an edge-coloring of the complete $n$ -vertex graph $K_{n}$ . The problem of finding properly colored and rainbow Hamilton cycles in $c$ was initiated in 1976 by Bollobás and…