Man

Maya Jakobine Stein

Full Professor

Universidad de Chile

Santiago, Chile

Líneas de Investigación


Graph Theory, Combinatorics, Theoretical Computer Science, Group Theory

Educación

  •  Mathematics, UNIVERSITAT HAMBURG. Alemania, 2002
  •  Mathematics, UNIVERSITAT HAMBURG. Alemania, 2005

Experiencia Académica

  •   Full Professor Full Time

    UNIVERSIDAD DE CHILE

    Facultad de Ciencias Fisicas y Matematicas

    Santiago, Chile

    2020 - At present

  •   Associate Professor Full Time

    UNIVERSIDAD DE CHILE

    Santiago, Chile

    2016 - 2020

  •   Associated Researcher Full Time

    UNIVERSIDAD DE CHILE

    Facultad de Ciencias Físicas y Matemáticas

    Santiago, Chile

    2008 - 2016

Experiencia Profesional

  •   Deputy director Other

    Department of Mathematical Engineering, University of Chile

    Santiago, Chile

    2018 - 2020

  •   PhD program coordinator Other

    Department of Mathematical Engineering, University of Chile

    Santiago, Chile

    2020 - At present

  •   Member of the Mathematics Evaluation Panel Other

    FONDECYT

    Santiago, Chile

    2017 - 2020

  •   Editor-in-Chief Other

    Electronic Journal of Combinatorics

    Australia

    2016 - At present

  •   Member of the Scientific Committee Other

    SOMACHI (Chilean Mathematicians' Society)

    Chile

    2017 - At present

  •   Deputy director of the Mathematics Evaluation Panel Other

    FONDECYT

    Chile

    2018 - 2020

Formación de Capital Humano


Supervision of students and postdocs:

Post-doc:
Matías Pavez (2021)
Daniel Quiroz (2017-18)
Andrea Jiménez (2014-15)

PhD Students:
Matías Pavez (2016-21)
Sebastián Bustamante (2015-18)
Richard Lang (2014-17)

Master's degree:
Matías Azocar (2021-)
Camila Zárate (2021-)
Alonso Cancino (2020-)
Freddy Flores (2019-20)
Camila Fernández (2019-20)
Alberto Rojas (2017-19)
Guido Besomi (2017-18)
Simón Piga (2016-17)
Sylvia Vergara (2013-14)
Sebastián Bustamante (2013-14)
Nicolás Sanhueza (2013-14)
Sergio Araneda (2012-13)

Visiting Students and Internships (doctoral/master/undergraduate students):
Gweneth McKinley, Massachssets Institute of Technology (2019)
Nóra Frankl, London School of Economics (2019)
Attila Dankovics, London School of Economics (2019)
Jan Corstens, London School of Economics (2019)
Adriana Diaz Torres, University of La Habana (2016)
Diego Navas Saucedo, Ecole Nationale Superieure Lyon (2014)
Julian Pott, Universität Hamburg (2011)
Fabian Hundertmark, Universität Hamburg (2011)


Premios y Distinciones

  •   FSMP Invited Distinguished Professor

    Fondation des Sciences Mathématiques de Paris

    Francia, 2013

    “Matching and Colouring in Graphs”, Université Pierre et Marie Curie, Paris


 

Article (53)

Better 3-coloring algorithms: Excluding a triangle and a seven vertex path
On the Erdős–Sós conjecture for trees with bounded degree
A variant of the Erdos-Sos conjecture
MAXIMUM AND MINIMUM DEGREE CONDITIONS FOR EMBEDDING TREES
Regularity inheritance in pseudorandom graphs
Almost partitioning 2-colored complete 3-uniform hypergraphs into two monochromatic tight or loose cycles
Approximately Coloring Graphs Without Long Induced Paths
DEGREE CONDITIONS FOR EMBEDDING TREES
Monochromatic tree covers and Ramsey numbers for set-coloured graphs
Partitioning 2-coloured complete k-uniform hypergraphs into monochromatic l-cycles
The domino problem on groups of polynomial growth
Almost partitioning 2-edge-colourings of 3-uniform hypergraphs with two monochromatic tight cycles
ALMOST PARTITIONING A 3-EDGE-COLORED Kn,n INTO FIVE MONOCHROMATIC CYCLES
Clique coloring B-1-EPG graphs
Local colourings and monochromatic partitions in complete bipartite graphs
THE APPROXIMATE LOBEL-KOMLOS-SOS CONJECTURE I: THE SPARSE DECOMPOSITION
THE APPROXIMATE LOEBL-KOMLOS-SOS CONJECTURE II: THE ROUGH STRUCTURE OF LKS GRAPHS
THE APPROXIMATE LOEBL-KOMLOS-SOS CONJECTURE III: THE FINER STRUCTURE OF LKS GRAPHS
THE APPROXIMATE LOEBL-KOMLOS-SOS CONJECTURE IV: EMBEDDING TECHNIQUES AND THE PROOF OF THE MAIN RESULT
Three-coloring and list three-coloring of graphs without induced paths on seven vertices
Convex p-partitions of bipartite graphs
List Edge-Coloring and Total Coloring in Graphs of Low Treewidth
Monochromatic Cycle Partitions in Local Edge Colorings
b-Coloring is NP-hard on Co-bipartite Graphs and Polytime Solvable on Tree-Cographs
Complexity of splits reconstruction for low-degree trees
Geodesic stability for memoryless binary long-lived consensus
Linear and projective boundaries in HNN-extensions and distortion phenomena
Local colourings and monochromatic partitions in complete bipartite graphs
Partitioning 3-edge-coloured complete bipartite graphs into monochromatic cycles
Partitioning two-coloured complete multipartite graphs into monochromatic paths and cycles
THE APPROXIMATE LOEBL-KOMLOS-SOS CONJECTURE AND EMBEDDING TREES IN SPARSE GRAPHS
Connectivity and tree structure in finite graphs
Cycles Are Strongly Ramsey-Unsaturated
Minimal bricks have many vertices of small degree
FORCING LARGE COMPLETE (TOPOLOGICAL) MINORS IN INFINITE GRAPHS
Small degree vertices in minimal bricks
An approximate version of the Loebl-Komlos-Sos conjecture
On claw-free t-perfect graphs
Extremal infinite graph theory
Stability in geodesics for memoryless binary long-lived consensus
The relative degree and large complete minors in infinite graphs
Duality of Ends
ENDS AND VERTICES OF SMALL DEGREE IN INFINITE MINIMALLY k-(EDGE)-CONNECTED GRAPHS
t-PERFECTION IS ALWAYS STRONG FOR CLAW-FREE GRAPHS
Characterising claw-free t-perfect graphs
The Loebl-Komlós-Sós conjecture for trees of diameter 5 and for certain caterpillars
An approximate version of the Loebl-Komlós-Sós conjecture .
Forcing highly connected subgraphs
On end degrees and infinite cycles in locally finite graphs
Arboricity and tree-packing in locally finite graphs
MacLane's planarity criterion for locally finite graphs
Cycle-cocycle partitions and faithful cycle covers for locally finite graphs
Menger's theorem for infinite graphs with ends

BookSection (1)

Tree containment and degree conditions

ConferencePaper (1)

Large Immersions in Graphs with Independence Number 3 and 4

Proyecto (8)

RANDNET
Extremal and Structural Problems in Graph Theory
STALGRAPH
FONDECYT REGULAR 1180830 Trees, Degrees and Colours
Nucleo Milenio Informacion y Coordenacion en Redes
STRUCTURAL AND EXTREMAL GRAPH THEORY
Algorithmic, algebraic and structural issues on coloring and matching theory of graphs
PROBLEMS IN EXTREMAL GRAPH THEORY
55
Maya Stein

Full Professor

Department of Mathematical Engineering

Universidad de Chile

Santiago, Chile

1
Hiep Han

Profesor

Departamento de Matemática y Ciencia de la Computación

UNIVERSIDAD DE SANTIAGO DE CHILE

Santiago, Chile

1
Karol Suchan

Profesor Asociado

Facultad de Ingeniería y Ciencias

Universidad Diego Portales

Santiago, Chile

1
martin matamala

Full Professor

Mathematical engineering

DEPARTAMENTO DE INGENIERIA MATEMATICA, FACULTAD DE CIENCIAS FÍSICAS Y MATEMATICAS, UNIVERSIDAD DE CHILE

santiago, Chile