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 2020 · math.COShow all

2 papers · 2 filters

math.CO2020

Dirac-type conditions for spanning bounded-degree hypertrees

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

We prove that for fixed $k$ , every $k$ -uniform hypergraph on $n$ vertices and of minimum codegree at least $n /2 + o (n)$ contains every spanning tight $k$ -tree of bounded vertex degre…

math.CO2020★ 3 cited

$3$ -Colouring $P_{t}$ -free graphs without short odd cycles

Alberto Rojas, Maya Stein

For any odd $t \geq 9$ , we present a polynomial-time algorithm that solves the $3$ -colouring problem, and finds a $3$ -colouring if one exists, in $P_{t}$ -free graphs of odd girth at…

Dirac-type conditions for spanning bounded-degree hypertrees

3-Colouring Pt​-free graphs without short odd cycles

$3$ -Colouring $P_{t}$ -free graphs without short odd cycles