M. Stein

activity

20242026

collaborators

Showing math.COShow all

4 papers · 1 filter

math.CO2026

Semidegree threshold for spanning trees in oriented graphs

Pedro AraÃºjo, Pedro Araújo, Giovanne Santos +1

We show that for all $γ > 0$ and $Δ \in N$ , there is some $n_{0}$ such that, if $n \geq n_{0}$ , then every oriented graph on $n$ vertices with minimum semidegree at least $(3/8…

math.CO2025

Embedding Nearly Spanning Trees

Bruce Reed, Maya Stein

The ErdÅs-SÃ³s Conjecture states that every graph with average degree exceeding $k - 1$ contains every tree with $k$ edges as a subgraph. We prove that there are $I^´ > 0$ and $k_0\in\…

math.CO2025

A bounded diameter strengthening of KÅnig's Theorem

Louis DeBiasio, AntÃ³nio GirÃ£o, Penny Haxell +1

K\H onig's theorem says that the vertex cover number of every bipartite graph is at most its matching number (in fact they are equal since, trivially, the matching number is at mos…

math.CO2024

Packing large balanced trees into bipartite graphs

Cristina G. Fernandes, TÃ¡ssio Naia, Giovanne Santos +1

We prove that for every $I^^{3} > 0$ there exists $n_{0} \in N$ such that for every $n \geq n_{0}$ any family of up to $⌊ n^{\frac{1}{2} + I^^{3}} ⌋$ trees having at most $(1…

Semidegree threshold for spanning trees in oriented graphs

Embedding Nearly Spanning Trees

A bounded diameter strengthening of KÅnig's Theorem

Packing large balanced trees into bipartite graphs

A bounded diameter strengthening of KÅnig's Theorem