maya jakobine stein

Associated reaearcher and assistant professor at the Centre for Mathematical Modeling (CMM), Universidad de Chile, Santiago.

ADDRESS TEACHING PUBLICATIONS

PREPRINTS:

The Approximate Loebl-Komlós-Sós Conjecture (with Jan Hladký, Janós Komlós, Diana Piguet, Miklós Simonovits, Endre Szemerédi), submitted PDF
Linear and projective boundaries in HNN-extensions and distortion phenomena (with J. Lehnert, B. Kroen), submitted PDF
Complexity of Splits Reconstruction for Low-Degree Trees (with S. Gaspers, M. Liedloff, K. Suchan), submitted PDF
Geodesic stability for memoryless binary long-lived consensus (with C. G. Fernandes), submitted arXiv

REFEREED JOURNAL PUBLICATIONS:

Minimal bricks have many vertices of small degree (with H. Bruhn), accepted for publication in European Journal of Combinatorics PDF
Cycles are strongly Ramsey unsaturated (with J. Skokan), accepted for publication in Combinatorics, Probablity and Computing PDF
Connectivity and tree structure in finite graphs (with J. Carmesin, R. Diestel, F. Hundertmark), accepted for publication in Combinatorica PDF
Forcing large complete minors in infinite graphs (with J. Zamora), accepted for publication in SIAM Journal on Discrete Mathematics PDF
An approximate version of the Loebl-Komlós-Sós conjecture (with D. Piguet), Journal of Combinatorial Theory, Series B, 102(1) 2012, p. 102-125 PDF
On claw-free t-perfect graphs (with H. Bruhn), Mathematical Programming, June 2012, Volume 133, Issue 1-2, pp 461-480 PDF
Extremal infinite graph theory, Discrete Mathematics 311 (Special Volume on Infinite Graphs), 2011, p. 1472-1496 PDF
Ends and vertices of small degree in infinite minimally k-(edge)-connected graphs, SIAM J. on Discrete Mathematics, 24 (4), 2010, p.1584-1596 PDF
t-perfection is always strong for claw-free graphs (with H. Bruhn) SIAM Journal on Discrete Mathematics, 24 (3), 2010, p.770-781 PDF
Duality of ends (with H. Bruhn), Combinatorics, Probability and Computing, 12 (1), 2010, p.47-60 PDF
The Loebl-Komlós-Sós conjecture for trees of diameter 5 and certain caterpillars (with D. Piguet), Electronic J. of Combinatorics, 15, 2008, R106 PDF
On end degrees and infinite circuits in locally finite graphs (with H. Bruhn), Combinatorica, 27, 2007, p.269-291 PDF
Forcing highly connected subgraphs, J. Graph Theory 54, 2007, p.331-349 PDF
Arboricity and tree-packing in locally finite graphs, J. Comb. Theory (Series B) 96, 2006, p.302-312 PDF
MacLane's planarity criterion for locally finite graphs (with H. Bruhn), J. Comb. Theory (Series B) 96, 2006, p.225-239 PDF
Menger's theorem for infinite graphs with ends (with H. Bruhn and R. Diestel), J. Graph Theory 50, 2005, p.199-211 PDF
Cycle-cocycle partitions and faithful cycle covers for locally finite graphs (with H. Bruhn and R. Diestel), J. Graph Theory 50, 2005, p.150-161 PDF

CONFERENCE PROCEEDINGS:

Complexity of Splits Reconstruction for Low Degree Trees (with S. Gaspers, M. Liedloff, K. Suchan), extended abstract accepted in WG 2011 arXiv
Stability in geodesics for memoryless binary long-lived consensus (with C. G .Fernandes), Lagos 2011, Electr. Notes in Discr. Math., 37 (2011), p.351-356 PDF
The relative degree and large complete minors in infinite graphs (with J. Zamora), Lagos 2011, Electr. Notes in Discr. Math, 37 (2011), p.129-134 PDF
Degree and Substructure in infinite graphs, Midsummer Combinatorial Workshop 2010, Charles University, Preprint KAM-Series 2011PDF
Characterising claw-free t-perfect graphs, extended abstract, Eurocomb '09 (with Henning Bruhn), Electr. Notes in Discr. Math., 34 (2009), p.501-507 PDF
An approximate version of the Loebl-Komlós-Sós conjecture, extended abstract, Eurocomb '07 (with D. Piguet), Electr. Notes in Discr. Math., 29 (2007), 249-253 PDF

THESES:

Extremal graph theory: Degree and substructure in finite and infinite graphs, Habilitationsschrift, Universiät Hamburg 2010 PDF
Ends of graphs, Doktorarbeit Universität Hamburg 2005 PDF
Die Erdös-Menger-Vermutung for abzählbare Graphen mit Enden, Diplomarbeit Universität Hamburg 2002, vergriffen.