Maya Stein
Maya Stein
Verified email at dim.uchile.cl - Homepage
Title
Cited by
Cited by
Year
Three-coloring and list three-coloring of graphs without induced paths on seven vertices
F Bonomo, M Chudnovsky, P Maceli, O Schaudt, M Stein, M Zhong
Combinatorica 38 (4), 779-801, 2018
722018
On end degrees and infinite cycles in locally finite graphs
H Bruhn, M Stein
Combinatorica 27 (3), 269, 2007
662007
Connectivity and tree structure in finite graphs
J Carmesin, R Diestel, F Hundertmark, M Stein
Combinatorica 34 (1), 11-46, 2014
542014
MacLane's planarity criterion for locally finite graphs
H Bruhn, M Stein
Journal of Combinatorial Theory, Series B 96 (2), 225-239, 2006
452006
Arboricity and tree-packing in locally finite graphs
MJ Stein
Journal of Combinatorial Theory, Series B 96 (2), 302-312, 2006
322006
The approximate Loebl--Komlós--Sós Conjecture I: The sparse decomposition
J Hladky, J Komlós, D Piguet, M Simonovits, M Stein, E Szemerédi
SIAM Journal on Discrete Mathematics 31 (2), 945-982, 2017
312017
Finite connectivity in infinite matroids
H Bruhn, P Wollan
European Journal of Combinatorics 33 (8), 1900-1912, 2012
302012
The approximate Loebl--Komlós--Sós Conjecture IV: Embedding techniques and the proof of the main result
J Hladky, J Komlós, D Piguet, M Simonovits, M Stein, E Szemerédi
SIAM Journal on Discrete Mathematics 31 (2), 1072-1148, 2017
292017
An approximate version of the Loebl–Komlós–Sós conjecture
D Piguet, MJ Stein
Journal of Combinatorial Theory, Series B 102 (1), 102-125, 2012
292012
Cycle‐cocycle partitions and faithful cycle covers for locally finite graphs
H Bruhn, R Diestel, M Stein
Journal of Graph Theory 50 (2), 150-161, 2005
292005
The approximate Loebl--Komlós--Sós Conjecture III: The finer structure of LKS graphs
J Hladky, J Komlós, D Piguet, M Simonovits, M Stein, E Szemerédi
SIAM Journal on Discrete Mathematics 31 (2), 1017-1071, 2017
282017
Extremal infinite graph theory
M Stein
Discrete mathematics 311 (15), 1472-1496, 2011
252011
Forcing highly connected subgraphs
MJ Stein
Journal of Graph Theory 54 (4), 331-349, 2007
212007
The Loebl–Komlós–Sós conjecture for trees of diameter 5 and certain caterpillars
D Piguet, M Stein
Electr. J. of Comb 15, R106, 2008
192008
The domino problem on groups of polynomial growth
A Ballier, M Stein
arXiv preprint arXiv:1311.4222, 2013
172013
Duality of ends
H Bruhn, M Stein
Combinatorics, Probability and Computing 19 (1), 47-60, 2010
172010
A variant of the Erdős‐Sós conjecture
F Havet, B Reed, M Stein, DR Wood
Journal of Graph Theory 94 (1), 131-158, 2020
162020
Monochromatic cycle partitions in local edge colorings
D Conlon, M Stein
Journal of Graph Theory 81 (2), 134-145, 2016
162016
The approximate Loebl-Komlós-Sós conjecture and embedding trees in sparse graphs
J Hladky, D Piguet, M Simonovits, M Stein, E Szemerédi
Electronic Research Announcements in Mathematical Sciences 22, 1-11, 2015
162015
Degree conditions for embedding trees
G Besomi, M Pavez-Signé, M Stein
SIAM Journal on Discrete Mathematics 33 (3), 1521-1555, 2019
142019
The system can't perform the operation now. Try again later.
Articles 1–20