default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMaya Jakobine Stein
Person information
- affiliation: University of Chile, Santiago, Chile
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j61]Freddy Flores Dubó, Maya Stein
:
On the Ramsey number of the double star. Discret. Math. 348(1): 114227 (2025)- 2024
- [j60]Maya Stein:
Kalai's conjecture in r-partite r-graphs. Eur. J. Comb. 117: 103827 (2024) - [j59]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: 103838 (2024) - [j58]Matías Pavez-Signé, Nicolás Sanhueza-Matamala, Maya Stein:
Dirac-type conditions for spanning bounded-degree hypertrees. J. Comb. Theory B 165: 97-141 (2024) - 2023
- [j57]Alberto Rojas Anríquez, Maya Stein:
3-Colouring Pt-Free Graphs Without Short Odd Cycles. Algorithmica 85(4): 831-853 (2023) - [j56]Maya Stein:
Monochromatic Paths in 2-Edge-Coloured Graphs and Hypergraphs. Electron. J. Comb. 30(1) (2023) - [j55]Tereza Klimosová, Maya Stein:
Antipaths in oriented graphs. Discret. Math. 346(9): 113515 (2023) - [j54]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): 737-783 (2023) - [j53]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): 797-821 (2023) - 2022
- [j52]Sebastián Bustamante, Daniel A. Quiroz, Maya Stein, José Zamora:
Clique immersions and independence number. Eur. J. Comb. 106: 103550 (2022) - 2021
- [j51]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): 741-761 (2021) - [j50]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: 98-115 (2021) - [c5]Quentin Lutz, Elie de Panafieu, Maya Stein, Alex Scott:
Active clustering for labeling training data. NeurIPS 2021: 8469-8480 - [i8]Quentin Lutz, Élie de Panafieu, Alex Scott, Maya Stein:
Active clustering for labeling training data. CoRR abs/2110.14521 (2021) - 2020
- [j49]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): 131-158 (2020) - [j48]Peter Allen, Julia Böttcher, Jozef Skokan, Maya Stein:
Regularity inheritance in pseudorandom graphs. Random Struct. Algorithms 56(2): 306-338 (2020) - [j47]Guido Besomi, Matías Pavez-Signé, Maya Stein:
Maximum and Minimum Degree Conditions for Embedding Trees. SIAM J. Discret. Math. 34(4): 2108-2123 (2020) - [i7]Alberto Rojas, Maya Stein:
3-Colouring Pt-free graphs without short odd cycles. CoRR abs/2008.04845 (2020)
2010 – 2019
- 2019
- [j46]Maria Chudnovsky, Oliver Schaudt, Sophie Spirkl, Maya Stein, Mingxian Zhong:
Approximately Coloring Graphs Without Long Induced Paths. Algorithmica 81(8): 3186-3199 (2019) - [j45]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): 5-15 (2019) - [j44]Oliver Schaudt, Maya Stein:
Partitioning two?coloured complete multipartite graphs into monochromatic paths and cycles. J. Graph Theory 91(2): 122-147 (2019) - [j43]Guido Besomi, Matías Pavez-Signé, Maya Stein:
Degree Conditions for Embedding Trees. SIAM J. Discret. Math. 33(3): 1521-1555 (2019) - [c4]Sebastián Bustamante, Daniel A. Quiroz, Maya Stein, José Zamora:
Large Immersions in Graphs with Independence Number 3 and 4. LAGOS 2019: 221-228 - 2018
- [j42]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): 779-801 (2018) - [j41]Sebastián Bustamante, Maya Stein:
Monochromatic tree covers and Ramsey numbers for set-coloured graphs. Discret. Math. 341(1): 266-276 (2018) - [j40]Sebastián Bustamante, Maya Stein:
Partitioning 2-coloured complete k-uniform hypergraphs into monochromatic ℓ-cycles. Eur. J. Comb. 71: 213-221 (2018) - 2017
- [j39]Flavia Bonomo, María Pía Mazzoleni, Maya Stein:
Clique coloring B1-EPG graphs. Discret. Math. 340(5): 1008-1011 (2017) - [j38]Richard Lang, Maya Stein:
Local colourings and monochromatic partitions in complete bipartite graphs. Eur. J. Comb. 60: 42-54 (2017) - [j37]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: 185-190 (2017) - [j36]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): 945-982 (2017) - [j35]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): 983-1016 (2017) - [j34]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): 1017-1071 (2017) - [j33]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): 1072-1148 (2017) - [j32]Richard Lang, Oliver Schaudt, Maya Stein:
Almost Partitioning a 3-Edge-Colored Kn, n into Five Monochromatic Cycles. SIAM J. Discret. Math. 31(2): 1374-1402 (2017) - [c3]Maria Chudnovsky, Oliver Schaudt, Sophie Spirkl, Maya Stein, Mingxian Zhong:
Approximately Coloring Graphs Without Long Induced Paths. WG 2017: 193-205 - 2016
- [j31]David Conlon, Maya Stein:
Monochromatic Cycle Partitions in Local Edge Colorings. J. Graph Theory 81(2): 134-145 (2016) - [j30]Henning Bruhn, Richard Lang, Maya Stein:
List Edge-Coloring and Total Coloring in Graphs of Low Treewidth. J. Graph Theory 81(3): 272-282 (2016) - [j29]Luciano N. Grippo, Martín Matamala, Martín Darío Safe, Maya J. Stein:
Convex p-partitions of bipartite graphs. Theor. Comput. Sci. 609: 511-514 (2016) - [i6]Maria Chudnovsky, Oliver Schaudt, Sophie Spirkl, Maya Stein, Mingxian Zhong:
Approximately coloring graphs without long induced paths. CoRR abs/1606.02967 (2016) - 2015
- [j28]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): 289-305 (2015) - [j27]Serge Gaspers, Mathieu Liedloff, Maya Jakobine Stein, Karol Suchan:
Complexity of splits reconstruction for low-degree trees. Discret. Appl. Math. 180: 89-100 (2015) - [j26]Richard Lang, Maya Stein:
Local colourings and monochromatic partitions in complete bipartite graphs. Electron. Notes Discret. Math. 49: 757-763 (2015) - [j25]Richard Lang, Oliver Schaudt, Maya Stein:
Partitioning 3-edge-coloured complete bipartite graphs into monochromatic cycles. Electron. Notes Discret. Math. 49: 787-794 (2015) - [j24]Oliver Schaudt, Maya Stein:
Partitioning two-coloured complete multipartite graphs into monochromatic paths and cycles. Electron. Notes Discret. Math. 50: 313-318 (2015) - [j23]Cristina G. Fernandes, Maya Jakobine Stein:
Geodesic stability for memoryless binary long-lived consensus. J. Comput. Syst. Sci. 81(7): 1210-1220 (2015) - 2014
- [j22]Johannes Carmesin, Reinhard Diestel, Fabian Hundertmark, Maya Stein:
Connectivity and tree structure in finite graphs. Comb. 34(1): 11-46 (2014) - [j21]Jozef Skokan, Maya Jakobine Stein:
Cycles Are Strongly Ramsey-Unsaturated. Comb. Probab. Comput. 23(4): 607-630 (2014) - [j20]Henning Bruhn, Maya Stein:
Minimal bricks have many vertices of small degree. Eur. J. Comb. 36: 261-269 (2014) - [c2]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: 100-111 - [i5]Oliver Schaudt, Maya Stein:
Partitioning two-coloured complete multipartite graphs into monochromatic paths. CoRR abs/1407.5083 (2014) - [i4]Flavia Bonomo, Oliver Schaudt, Maya Jakobine Stein:
3-Colouring graphs without triangles or induced paths on seven vertices. CoRR abs/1410.0040 (2014) - 2013
- [j19]Henning Bruhn, Maya Stein:
Small degree vertices in minimal bricks. Electron. Notes Discret. Math. 44: 95-100 (2013) - [j18]Maya Stein, José Zamora:
Forcing Large Complete (Topological) Minors in Infinite Graphs. SIAM J. Discret. Math. 27(2): 697-707 (2013) - [i3]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 abs/1310.8313 (2013) - 2012
- [j17]Diana Piguet, Maya Jakobine Stein:
An approximate version of the Loebl-Komlós-Sós conjecture. J. Comb. Theory B 102(1): 102-125 (2012) - [j16]Henning Bruhn, Maya Stein:
On claw-free t-perfect graphs. Math. Program. 133(1-2): 461-480 (2012) - 2011
- [j15]Maya Stein:
Extremal infinite graph theory. Discret. Math. 311(15): 1472-1496 (2011) - [j14]Maya Stein, José Zamora:
The relative degree and large complete minors in infinite graphs. Electron. Notes Discret. Math. 37: 129-134 (2011) - [j13]Cristina G. Fernandes, Maya Stein:
Stability in geodesics for memoryless binary long-lived consensus. Electron. Notes Discret. Math. 37: 351-356 (2011) - [c1]Serge Gaspers, Mathieu Liedloff, Maya Stein, Karol Suchan:
Complexity of Splits Reconstruction for Low-Degree Trees. WG 2011: 167-178 - [i2]Cristina G. Fernandes, Maya Stein:
Geodesic stability for memoryless binary long-lived consensus. CoRR abs/1102.4100 (2011) - 2010
- [j12]Henning Bruhn, Maya Jakobine Stein:
Duality of Ends. Comb. Probab. Comput. 19(1): 47-60 (2010) - [j11]Henning Bruhn, Maya Stein:
t-Perfection Is Always Strong for Claw-Free Graphs. SIAM J. Discret. Math. 24(3): 770-781 (2010) - [j10]Maya Stein:
Ends and Vertices of Small Degree in Infinite Minimally k-(Edge)-Connected Graphs. SIAM J. Discret. Math. 24(4): 1584-1596 (2010) - [i1]Serge Gaspers, Mathieu Liedloff, Maya Stein, Karol Suchan:
Complexity of Splits Reconstruction for Low-Degree Trees. CoRR abs/1007.1733 (2010)
2000 – 2009
- 2009
- [j9]Maya Stein, Henning Bruhn:
Characterising claw-free t-perfect graphs. Electron. Notes Discret. Math. 34: 501-507 (2009) - 2008
- [j8]Diana Piguet, Maya Jakobine Stein:
The Loebl-Komlós-Sós Conjecture for Trees of Diameter 5 and for Certain Caterpillars. Electron. J. Comb. 15(1) (2008) - 2007
- [j7]Henning Bruhn, Maya Stein:
On end degrees and infinite cycles in locally finite graphs. Comb. 27(3): 269-291 (2007) - [j6]Diana Piguet, Maya Stein:
An approximate version of the Loebl-Komlós-Sós conjecture. Electron. Notes Discret. Math. 29: 249-253 (2007) - [j5]Maya Jakobine Stein:
Forcing highly connected subgraphs. J. Graph Theory 54(4): 331-349 (2007) - 2006
- [j4]Henning Bruhn, Maya Jakobine Stein:
MacLane's planarity criterion for locally finite graphs. J. Comb. Theory B 96(2): 225-239 (2006) - [j3]Maya Jakobine Stein:
Arboricity and tree-packing in locally finite graphs. J. Comb. Theory B 96(2): 302-312 (2006) - 2005
- [j2]Henning Bruhn, Reinhard Diestel, Maya Stein:
Cycle-cocycle partitions and faithful cycle covers for locally finite graphs. J. Graph Theory 50(2): 150-161 (2005) - [j1]Henning Bruhn, Reinhard Diestel, Maya Stein:
Menger's theorem for infinite graphs with ends. J. Graph Theory 50(3): 199-211 (2005)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-10 01:16 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
