Maya Stein

Publication Activity (10 Years)

Years Active: 2005-2024
Publications (10 Years): 37

Top Topics

Maximum Cardinality

Bipartite Graph

Top Venues

SIAM J. Discret. Math.

J. Graph Theory

Publications

Matías Pavez-Signé, Nicolás Sanhueza-Matamala, Maya Stein
Dirac-type conditions for spanning bounded-degree hypertrees. J. Comb. Theory, Ser. B 165 (2024)
Maya Stein
Kalai's conjecture in r-partite r-graphs. Eur. J. Comb. 117 (2024)
Peter Allen, Julia Böttcher, Richard Lang, Jozef Skokan, Maya Stein
Partitioning a 2-edge-coloured graph of minimum degree 2n/3+o(n) into three monochromatic cycles. Eur. J. Comb. 121 (2024)
Tereza Klimosová, Maya Stein
Antipaths in oriented graphs. Discret. Math. 346 (9) (2023)
Bruce A. Reed, Maya Stein
Spanning trees in graphs of high minimum degree with a universal vertex I: An asymptotic result. J. Graph Theory 102 (4) (2023)
Alberto Rojas Anríquez, Maya Stein
-Free Graphs Without Short Odd Cycles. Algorithmica 85 (4) (2023)
Bruce A. Reed, Maya Stein
Spanning trees in graphs of high minimum degree with a universal vertex II: A tight result. J. Graph Theory 102 (4) (2023)
Maya Stein
Monochromatic Paths in 2-Edge-Coloured Graphs and Hypergraphs. Electron. J. Comb. 30 (1) (2023)
Sebastián Bustamante, Daniel A. Quiroz, Maya Stein, José Zamora
Clique immersions and independence number. Eur. J. Comb. 106 (2022)
Quentin Lutz, Elie de Panafieu, Maya Stein, Alex Scott
Active clustering for labeling training data. NeurIPS (2021)
Flavia Bonomo-Braberman, Maria Chudnovsky, Jan Goedgebeur, Peter Maceli, Oliver Schaudt, Maya Stein, Mingxian Zhong
Better 3-coloring algorithms: Excluding a triangle and a seven vertex path. Theor. Comput. Sci. 850 (2021)
Guido Besomi, Matías Pavez-Signé, Maya Stein
On the Erdős-Sós conjecture for trees with bounded degree. Comb. Probab. Comput. 30 (5) (2021)
Quentin Lutz, Élie de Panafieu, Alex Scott, Maya Stein
Active clustering for labeling training data. CoRR (2021)
Alberto Rojas, Maya Stein
-free graphs without short odd cycles. CoRR (2020)
Guido Besomi, Matías Pavez-Signé, Maya Stein
Maximum and Minimum Degree Conditions for Embedding Trees. SIAM J. Discret. Math. 34 (4) (2020)
Frédéric Havet, Bruce A. Reed, Maya Stein, David R. Wood
A variant of the Erdős-Sós conjecture. J. Graph Theory 94 (1) (2020)
Peter Allen, Julia Böttcher, Jozef Skokan, Maya Stein
Regularity inheritance in pseudorandom graphs. Random Struct. Algorithms 56 (2) (2020)
Maria Chudnovsky, Oliver Schaudt, Sophie Spirkl, Maya Stein, Mingxian Zhong
Approximately Coloring Graphs Without Long Induced Paths. Algorithmica 81 (8) (2019)
Sebastián Bustamante, Daniel A. Quiroz, Maya Stein, José Zamora
Large Immersions in Graphs with Independence Number 3 and 4. LAGOS (2019)
Sebastián Bustamante, Hiêp Hàn, Maya Stein
Almost partitioning 2?colored complete 3?uniform hypergraphs into two monochromatic tight or loose cycles. J. Graph Theory 91 (1) (2019)
Guido Besomi, Matías Pavez-Signé, Maya Stein
Degree Conditions for Embedding Trees. SIAM J. Discret. Math. 33 (3) (2019)
Oliver Schaudt, Maya Stein
Partitioning two?coloured complete multipartite graphs into monochromatic paths and cycles. J. Graph Theory 91 (2) (2019)
Sebastián Bustamante, Maya Stein
Monochromatic tree covers and Ramsey numbers for set-coloured graphs. Discret. Math. 341 (1) (2018)
Flavia Bonomo, Maria Chudnovsky, Peter Maceli, Oliver Schaudt, Maya Stein, Mingxian Zhong
Three-Coloring and List Three-Coloring of Graphs Without Induced Paths on Seven Vertices. Comb. 38 (4) (2018)
Sebastián Bustamante, Maya Stein
Partitioning 2-coloured complete k-uniform hypergraphs into monochromatic ℓ-cycles. Eur. J. Comb. 71 (2018)
Maria Chudnovsky, Oliver Schaudt, Sophie Spirkl, Maya Stein, Mingxian Zhong
Approximately Coloring Graphs Without Long Induced Paths. WG (2017)
Jan Hladký, János Komlós, Diana Piguet, Miklós Simonovits, Maya Stein, Endre Szemerédi
The Approximate Loebl-Komlós-Sós Conjecture IV: Embedding Techniques and the Proof of the Main Result. SIAM J. Discret. Math. 31 (2) (2017)
Flavia Bonomo, María Pía Mazzoleni, Maya Stein
-EPG graphs. Discret. Math. 340 (5) (2017)
Sebastián Bustamante, Hiêp Hàn, Maya Stein
Almost partitioning 2-edge-colourings of 3-uniform hypergraphs with two monochromatic tight cycles. Electron. Notes Discret. Math. 61 (2017)
Richard Lang, Oliver Schaudt, Maya Stein
into Five Monochromatic Cycles. SIAM J. Discret. Math. 31 (2) (2017)
Jan Hladký, János Komlós, Diana Piguet, Miklós Simonovits, Maya Stein, Endre Szemerédi
The Approximate Loebl-Komlós-Sós Conjecture I: The Sparse Decomposition. SIAM J. Discret. Math. 31 (2) (2017)
Richard Lang, Maya Stein
Local colourings and monochromatic partitions in complete bipartite graphs. Eur. J. Comb. 60 (2017)
Jan Hladký, János Komlós, Diana Piguet, Miklós Simonovits, Maya Stein, Endre Szemerédi
The Approximate Loebl-Komlós-Sós Conjecture III: The Finer Structure of LKS Graphs. SIAM J. Discret. Math. 31 (2) (2017)
Jan Hladký, János Komlós, Diana Piguet, Miklós Simonovits, Maya Stein, Endre Szemerédi
The Approximate Loebl-Komlós-Sós Conjecture II: The Rough Structure of LKS Graphs. SIAM J. Discret. Math. 31 (2) (2017)
Maria Chudnovsky, Oliver Schaudt, Sophie Spirkl, Maya Stein, Mingxian Zhong
Approximately coloring graphs without long induced paths. CoRR (2016)
David Conlon, Maya Stein
Monochromatic Cycle Partitions in Local Edge Colorings. J. Graph Theory 81 (2) (2016)
Henning Bruhn, Richard Lang, Maya Stein
List Edge-Coloring and Total Coloring in Graphs of Low Treewidth. J. Graph Theory 81 (3) (2016)
Richard Lang, Oliver Schaudt, Maya Stein
Partitioning 3-edge-coloured complete bipartite graphs into monochromatic cycles. Electron. Notes Discret. Math. 49 (2015)
Richard Lang, Maya Stein
Local colourings and monochromatic partitions in complete bipartite graphs. Electron. Notes Discret. Math. 49 (2015)
Oliver Schaudt, Maya Stein
Partitioning two-coloured complete multipartite graphs into monochromatic paths and cycles. Electron. Notes Discret. Math. 50 (2015)
Flavia Bonomo, Oliver Schaudt, Maya Stein, Mario Valencia-Pabon
b-Coloring is NP-hard on Co-bipartite Graphs and Polytime Solvable on Tree-Cographs. Algorithmica 73 (2) (2015)
Henning Bruhn, Maya Stein
Minimal bricks have many vertices of small degree. Eur. J. Comb. 36 (2014)
Oliver Schaudt, Maya Stein
Partitioning two-coloured complete multipartite graphs into monochromatic paths. CoRR (2014)
Johannes Carmesin, Reinhard Diestel, Fabian Hundertmark, Maya Stein
Connectivity and tree structure in finite graphs. Comb. 34 (1) (2014)
Flavia Bonomo, Oliver Schaudt, Maya Stein, Mario Valencia-Pabon
b-Coloring is NP-Hard on Co-Bipartite Graphs and Polytime Solvable on Tree-Cographs. ISCO (2014)
Henning Bruhn, Maya Stein
Small degree vertices in minimal bricks. Electron. Notes Discret. Math. 44 (2013)
Maya Stein, José Zamora
Forcing Large Complete (Topological) Minors in Infinite Graphs. SIAM J. Discret. Math. 27 (2) (2013)
Flavia Bonomo, Oliver Schaudt, Maya Stein, Mario Valencia-Pabon
b-coloring is NP-hard on co-bipartite graphs and polytime solvable on tree-cographs. CoRR (2013)
Henning Bruhn, Maya Stein
On claw-free t-perfect graphs. Math. Program. 133 (1-2) (2012)
Serge Gaspers, Mathieu Liedloff, Maya Stein, Karol Suchan
Complexity of Splits Reconstruction for Low-Degree Trees. WG (2011)
Maya Stein
Extremal infinite graph theory. Discret. Math. 311 (15) (2011)
Cristina G. Fernandes, Maya Stein
Stability in geodesics for memoryless binary long-lived consensus. Electron. Notes Discret. Math. 37 (2011)
Cristina G. Fernandes, Maya Stein
Geodesic stability for memoryless binary long-lived consensus CoRR (2011)
Maya Stein, José Zamora
The relative degree and large complete minors in infinite graphs. Electron. Notes Discret. Math. 37 (2011)
Henning Bruhn, Maya Stein
t-Perfection Is Always Strong for Claw-Free Graphs. SIAM J. Discret. Math. 24 (3) (2010)
Maya Stein
Ends and Vertices of Small Degree in Infinite Minimally k-(Edge)-Connected Graphs. SIAM J. Discret. Math. 24 (4) (2010)
Serge Gaspers, Mathieu Liedloff, Maya Stein, Karol Suchan
Complexity of Splits Reconstruction for Low-Degree Trees CoRR (2010)
Maya Stein, Henning Bruhn
Characterising claw-free t-perfect graphs. Electron. Notes Discret. Math. 34 (2009)
Diana Piguet, Maya Stein
An approximate version of the Loebl-Komlós-Sós conjecture. Electron. Notes Discret. Math. 29 (2007)
Henning Bruhn, Maya Stein
On end degrees and infinite cycles in locally finite graphs. Comb. 27 (3) (2007)
Henning Bruhn, Reinhard Diestel, Maya Stein
Menger's theorem for infinite graphs with ends. J. Graph Theory 50 (3) (2005)
Henning Bruhn, Reinhard Diestel, Maya Stein
Cycle-cocycle partitions and faithful cycle covers for locally finite graphs. J. Graph Theory 50 (2) (2005)