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

2 papers · 2 filters

math.CO2018★ 2 cited

Maximum and minimum degree conditions for embedding trees

Guido Besomi, Matías Pavez-Signé, Maya Stein

We propose the following conjecture: For every fixed $α \in [0, \frac{1}{3})$ , each graph of minimum degree at least $(1 + α) \frac{k}{2}$ and maximum degree at least $2 (1 - α) k$ contains each…

math.CO2018

Degree conditions for embedding trees

Guido Besomi, Matías Pavez-Signé, Maya Stein

We conjecture that every $n$ -vertex graph of minimum degree at least $\frac{k}{2}$ and maximum degree at least $2 k$ contains all trees with $k$ edges as subgraphs. We prove an approxi…