M. Stein

activity

20072022

most citedConnectivity and tree structure in finite graphs

43 citations · 235 across the 46 of their papers we have counts for

collaborators

Showing math.COShow all

41 papers · 1 filter

math.CO2022

Antipaths in oriented graphs

Tereza Klimošová, Maya Stein

We show that for any natural number $k \geq 1$ , any oriented graph $D$ of minimum semidegree at least $(3 k - 2) /4$ contains an antidirected path of length $k$ . In fact, a slightly we…

math.CO2022★ 2 cited

Antidirected subgraphs of oriented graphs

Maya Stein, Camila Zárate-Guerén

We show that for every $η > 0$ every sufficiently large $n$ -vertex oriented graph D of minimum semidegree exceeding $(1 + η) k /2$ contains every balanced antidirected tree with $k$ e…

math.CO2022★ 1 cited

Monochromatic paths in $2$ -edge coloured graphs and hypergraphs

Maya Stein

We answer a question of Gyárfás and Sárközy from 2013 by showing that every 2-edge-coloured complete 3-uniform hypergraph can be partitioned into two monochromatic tight paths of d…

math.CO2022

Partitioning a 2-edge-coloured graph of minimum degree $2 n /3 + o (n)$ into three monochromatic cycles

Peter Allen, Julia Böttcher, Richard Lang +2

Lehel conjectured in the 1970s that every red and blue edge-coloured complete graph can be partitioned into two monochromatic cycles. This was confirmed in 2010 by Bessy and Thomas…

math.CO2021★ 1 cited

Towards a hypergraph version of the Pósa-Seymour conjecture

Matías Pavez-Signé, Nicolás Sanhueza-Matamala, Maya Stein

We prove that for fixed $r \geq k \geq 2$ , every $k$ -uniform hypergraph on $n$ vertices having minimum codegree at least $(1 - ((k - 1 r - 1) + (k - 2 r - 2))^{- 1}) n + o (n)$ contains t…

math.CO2020

Dirac-type conditions for spanning bounded-degree hypertrees