maya jakobine stein

Associate professor at the Department of Mathematical Engineering, Universidad de Chile, Santiago.


ADDRESS       TEACHING       STUDENTS       PUBLICATIONS       EDITORIAL AND ACADEMIC SERVICE


    Preprints:

    1. A Variant of the Erdos-Sos conjecture (with Fred Havet, Bruce Reed, David Wood) PDF
    2. Regularity inheritance in pseudorandom graphs (with Peter Allen, Julia Boettcher, Jozef Skokan) PDF
    3. Approximately coloring graphs without long induced paths (with M. Chudnovsky, O. Schaudt, S. Spirkl, M. Zhong) PDF
    4. 3-Colouring graphs without triangles or induced paths on seven vertices (with F. Bonomo, M. Chudnovsky, P. Maceli, O. Schaudt and M. Zhong), PDF
    5. Partitioning two-coloured complete multipartite graphs into monochromatic paths (with Oliver Schaudt), submitted PDF

    Accepted for publication:

    1. Monochromatic tree covers for multicoloured graphs (with Sebastián Bustamante), accepted in Discrete Mathematics PDF
    2. The domino problem on groups of polynomial growth (with Alexis Ballier), accepted for publication in Groups, Geometry and Dynamics PDF

    Refereed journal publications:

    1. Three-coloring and list-three-coloring of graphs without induced paths on seven vertices (with F. Bonomo, M. Chudnovsky, P. Maceli, O. Schaudt, M. Zhong), Combinatorica published online 31 May 2017, doi 10.1007/s00493-017-3553-8 PDF
    2. Almost partitioning a 3-edge coloured K_n,n into 5 monochromatic cycles (with Richard Lang, Oliver Schaudt), SIAM Journal on Discrete Mathematics, Vol. 31, Issue 2 (2017), pp. 1374-1402 PDF
    3. The approximate Loebl-Komlós-Sós Conjecture I: The sparse decomposition (with J. Hladký, J. Komlós, D. Piguet, M. Simonovits, E. Szemerédi), SIAM Journal on Discrete Mathematics 31-2 (2017), pages 945-982 PDF
    4. The approximate Loebl-Komlós-Sós Conjecture II: The rough structure of LKS graphs (with J. Hladký, J. Komlós, D. Piguet, M. Simonovits, E. Szemerédi), SIAM Journal on Discrete Mathematics 31-2 (2017), pages 983-1016 PDF
    5. The approximate Loebl-Komlós-Sós Conjecture III: The finer structure of LKS graphs (with J. Hladký, J. Komlós, D. Piguet, M. Simonovits, E. Szemerédi), SIAM Journal on Discrete Mathematics 31-2 (2017), pages 1017-1071 PDF
    6. The approximate Loebl-Komlós-Sós Conjecture IV: Embedding techniques and the proof of the main result (with J. Hladký, J. Komlós, D. Piguet, M. Simonovits, E. Szemerédi), SIAM Journal on Discrete Mathematics 31-2 (2017), pages 1072-1148 PDF
    7. Clique coloring B1-EPG graphs (with Flavia Bonomo and Pia Mazzoleni), Discrete Mathematics, Volume 340, Issue 5, May 2017, pages 1008-1011 PDF
    8. Local colourings and monochromatic partitions in complete bipartite graphs (with R. Lang), European Journal of Combinatorics , Volume 60, February 2017, pages 42-54 PDF
    9. Convex p-partitions of bipartite graphs (with L. Grippo, M. Matamala, M. Safe), Theoretical Computer Science, Volume 609 (2016), pp. 511-514 PDF
    10. Monochromatic Cycle Partitions in Local Edge Colourings (with David Conlon), Journal of Graph Theory, Volume 81, Issue 2 (2016), pages 134-145 PDF
    11. List edge colouring and total colouring in graphs of low treewidth (with Henning Bruhn, Richard Lang), Journal of Graph Theory, Volume 81, Issue 3 (2016), pages 272-282 PDF
    12. The approximate Loebl-Komlós-Sós conjecture and embedding treees in sparse graphs (with J. Hladký, D. Piguet, M. Simonovits, E. Szemerédi), Electronic Research Announcements in Mathematical Sciences , Volume 22, pp 1-11, 2015 PDF
    13. b-colouring is NP-hard on co-bipartite graphs and polytime solvable on tree-cographs (with Flavia Bonomo, Oliver Schaudt, Mario Valencia-Pabon), Algorithmica , Volume 73, Issue 2 (2015) pp 289 - 305 PDF
    14. Geodesic stability for memoryless binary long-lived consensus (with C. G. Fernandes), Journal of Computer and System Sciences, Volume 81, Issue 7, November 2015, pp 1210-120 PDF
    15. Linear and projective boundaries in HNN-extensions and distortion phenomena (with J. Lehnert, B. Kroen), Journal of Group Theory, Volume 18, Issue 3, pp 455-488, February 2015 PDF
    16. Complexity of Splits Reconstruction for Low-Degree Trees (with Serge Gaspers, Mathieu Liedloff, Karol Suchan), Discrete Applied Mathematics , January 2015, Vol. 180, p. 89-100 PDF
    17. Cycles are strongly Ramsey unsaturated (with J. Skokan), Combinatorics, Probability and Computing, 2014, Volume 23, Issue 04, pp 607-630 PDF
    18. Minimal bricks have many vertices of small degree (with H. Bruhn), European Journal of Combinatorics, 2014, Volume 36, pp.261-269 PDF
    19. Connectivity and tree structure in finite graphs (with J. Carmesin, R. Diestel, F. Hundertmark), Combinatorica, 2014, Volume 34, Issue 1, pp 11-46 PDF
    20. Forcing large complete minors in infinite graphs (with J. Zamora), SIAM Journal on Discrete Mathematics , 27(2), 2013, 697-707 PDF
    21. 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
    22. On claw-free t-perfect graphs (with H. Bruhn), Mathematical Programming , June 2012, Volume 133, Issue 1-2, pp 461-480 PDF
    23. Extremal infinite graph theory, Discrete Mathematics 311 (Special Volume on Infinite Graphs), 2011, p. 1472-1496 PDF
    24. Ends and vertices of small degree in infinite minimally k-(edge)-connected graphs, SIAM Journal on Discrete Mathematics, 24 (4), 2010, p.1584-1596 PDF
    25. t-perfection is always strong for claw-free graphs (with H. Bruhn) SIAM Journal on Discrete Mathematics , 24 (3), 2010, p.770-781 PDF
    26. Duality of ends (with H. Bruhn), Combinatorics, Probability and Computing , 12 (1), 2010, p.47-60 PDF
    27. The Loebl-Komlós-Sós conjecture for trees of diameter 5 and certain caterpillars (with D. Piguet), Electronic Journal of Combinatorics , 15, 2008, R106 PDF
    28. On end degrees and infinite circuits in locally finite graphs (with H. Bruhn), Combinatorica, 27, 2007, p.269-291 PDF
    29. Forcing highly connected subgraphs, Journal of Graph Theory 54, 2007, p.331-349 PDF
    30. Arboricity and tree-packing in locally finite graphs, Journal of Combinatorial Theory (Series B) 96, 2006, p.302-312 PDF
    31. MacLane's planarity criterion for locally finite graphs (with H. Bruhn), Journal of Combinatorial Theory (Series B) 96, 2006, p.225-239 PDF
    32. Menger's theorem for infinite graphs with ends (with H. Bruhn and R. Diestel), Journal of Graph Theory 50, 2005, p.199-211 PDF
    33. Cycle-cocycle partitions and faithful cycle covers for locally finite graphs (with H. Bruhn and R. Diestel), Journal of Graph Theory 50, 2005, p.150-161 PDF

    Conference proceedings:

    1. Almost partitioning 2-edge-colourings of 3-uniform hypergraphs with two monochromatic tight cycles (with Sebastian Bustamante and Hiep Han), accepted for Eurocomb 2017
    2. Local colourings and monochromatic partitions in complete bipartite graphs (with Richard Lang), Eurocomb 2015, Electronic Notes in Discrete Mathematics, Volume 49, 2015, pp757-763
    3. Partitioning 3-edge-coloured complete bipartite graphs into monochromatic cycles (with Richard Lang, Oliver Schaudt), Eurocomb 2015, Electronic Notes in Discrete Mathematics, Volume 49, 2015, pp. 787-794
    4. Partitioning two-coloured complete multipartite graphs into monochromatic paths and cycles (with O. Schaudt), LAGOS 2015, Electronic Notes in Discrete MAthematics, Volume 50, 2015, pp. 313-318
    5. b-coloring is NP-hard on co-bipartite graphs and polytime solvable on tree-cographs (with F. Bonomo, M. Valencia-Pabon, O. Schaudt), ISCO 2014, LNCS 8596, 100-111
    6. Small degree vertices in minimal bricks (with H. Bruhn), LAGOS 2013, Electronic Notes in Discr. Math., 2013, Volume 44, pp. 95-100
    7. Complexity of Splits Reconstruction for Low Degree Trees (with S. Gaspers, M. Liedloff, K. Suchan), WG 2011, LNCS 6986, 2011, pp.167-178 arXiv
    8. Stability in geodesics for memoryless binary long-lived consensus (with C. G .Fernandes), Lagos 2011, Electr. Notes in Discr. Math., 37 (2011), pp.351-356 PDF
    9. 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
    10. Degree and Substructure in infinite graphs, Midsummer Combinatorial Workshop 2010, Charles University, Preprint KAM-Series 2011PDF
    11. Characterising claw-free t-perfect graphs, extended abstract, Eurocomb '09 (with Henning Bruhn), Electr. Notes in Discr. Math., 34 (2009), pp.501-507 PDF
    12. 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:

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