Maya Stein

most citedMonochromatic cycle partitions in local edge colourings

6 citations · 11 across the 3 of their papers we have counts for

collaborators

3 papers

math.CO2019★ 3 cited

Kalai's conjecture in $r$ -partite $r$ -graphs

Maya Stein

Kalai conjectured that every $n$ -vertex $r$ -uniform hypergraph with more than $\frac{t - 1}{r} (r - 1 n)$ edges contains all tight $r$ -trees of some fixed size $t$ . We prove Ka…

math.CO2014★ 2 cited

Partitioning two-coloured complete multipartite graphs into monochromatic paths and cycles

Oliver Schaudt, Maya Stein

We show that any complete $k$ -partite graph $G$ on $n$ vertices, with $k \geq 3$ , whose edges are two-coloured, can be covered with two vertex-disjoint monochromatic paths of distin…

math.CO2014★ 6 cited

Monochromatic cycle partitions in local edge colourings

David Conlon, Maya Stein

An edge colouring of a graph is said to be an $r$ -local colouring if the edges incident to any vertex are coloured with at most $r$ colours. Generalising a result of Bessy and Thom…

Kalai's conjecture in r-partite r-graphs

Partitioning two-coloured complete multipartite graphs into monochromatic paths and cycles

Monochromatic cycle partitions in local edge colourings

Kalai's conjecture in $r$ -partite $r$ -graphs