43 citations · 235 across the 46 of their papers we have counts for
6 papers · 2 filters
Kalai's conjecture in -partite -graphs
Maya Stein
Kalai conjectured that every -vertex -uniform hypergraph with more than edges contains all tight -trees of some fixed size . We prove Ka…
Tree containment and degree conditions
Maya Stein
We survey results and open problems relating degree conditions with tree containment in graphs, random graphs, digraphs and hypergraphs, and their applications in Ramsey theory.
Clique immersions and independence number
Sebastián Bustamante, Daniel A. Quiroz, Maya Stein +1
The analogue of Hadwiger's conjecture for the immersion order states that every graph contains as an immersion. If true, it would imply that every graph with ver…
On the Erdős-Sós conjecture for trees with bounded degree
Guido Besomi, Matías Pavez-Signé, Maya Stein
We prove the Erd\H os--Sós conjecture for trees with bounded maximum degree and large dense host graphs. As a corollary, we obtain an upper bound on the multicolour Ramsey number o…
Spanning Trees in Graphs of High Minimum Degree with a Universal Vertex II: A Tight Result
Bruce Reed, Maya Stein
We prove that, if is sufficiently large, every graph on vertices that has a universal vertex and minimum degree at least contains each tree…
Spanning Trees in Graphs of High Minimum Degree with a Universal Vertex I: An Asymptotic Result
Bruce Reed, Maya Stein
In this paper and a companion paper, we prove that, if is sufficiently large, every graph on vertices that has a universal vertex and minimum degree at least $\lfloor \fr…