Maya Jakobine Stein

According to our database1, Maya Jakobine Stein authored at least 49 papers between 2005 and 2020.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2020
Regularity inheritance in pseudorandom graphs.
Random Struct. Algorithms, 2020

A variant of the Erdős-Sós conjecture.
J. Graph Theory, 2020

3-Colouring P<sub>t</sub>-free graphs without short odd cycles.
CoRR, 2020

2019
Degree Conditions for Embedding Trees.
SIAM J. Discret. Math., 2019

Almost partitioning 2?colored complete 3?uniform hypergraphs into two monochromatic tight or loose cycles.
J. Graph Theory, 2019

Large Immersions in Graphs with Independence Number 3 and 4.
Proceedings of the tenth Latin and American Algorithms, Graphs and Optimization Symposium, 2019

Approximately Coloring Graphs Without Long Induced Paths.
Algorithmica, 2019

2018
Partitioning 2-coloured complete k-uniform hypergraphs into monochromatic ℓ-cycles.
Eur. J. Comb., 2018

Monochromatic tree covers and Ramsey numbers for set-coloured graphs.
Discret. Math., 2018

Three-Coloring and List Three-Coloring of Graphs Without Induced Paths on Seven Vertices.
Comb., 2018

2017
Almost Partitioning a 3-Edge-Colored K<sub>n, n</sub> into Five Monochromatic Cycles.
SIAM J. Discret. Math., 2017

The Approximate Loebl-Komlós-Sós Conjecture IV: Embedding Techniques and the Proof of the Main Result.
SIAM J. Discret. Math., 2017

The Approximate Loebl-Komlós-Sós Conjecture III: The Finer Structure of LKS Graphs.
SIAM J. Discret. Math., 2017

The Approximate Loebl-Komlós-Sós Conjecture II: The Rough Structure of LKS Graphs.
SIAM J. Discret. Math., 2017

The Approximate Loebl-Komlós-Sós Conjecture I: The Sparse Decomposition.
SIAM J. Discret. Math., 2017

Almost partitioning 2-edge-colourings of 3-uniform hypergraphs with two monochromatic tight cycles.
Electron. Notes Discret. Math., 2017

Clique coloring B<sub>1</sub>-EPG graphs.
Discret. Math., 2017

2016
Convex p-partitions of bipartite graphs.
Theor. Comput. Sci., 2016

Monochromatic Cycle Partitions in Local Edge Colorings.
J. Graph Theory, 2016

List Edge-Coloring and Total Coloring in Graphs of Low Treewidth.
J. Graph Theory, 2016

2015
Geodesic stability for memoryless binary long-lived consensus.
J. Comput. Syst. Sci., 2015

Partitioning two-coloured complete multipartite graphs into monochromatic paths and cycles.
Electron. Notes Discret. Math., 2015

Partitioning 3-edge-coloured complete bipartite graphs into monochromatic cycles.
Electron. Notes Discret. Math., 2015

Local colourings and monochromatic partitions in complete bipartite graphs.
Electron. Notes Discret. Math., 2015

Complexity of splits reconstruction for low-degree trees.
Discret. Appl. Math., 2015

b-Coloring is NP-hard on Co-bipartite Graphs and Polytime Solvable on Tree-Cographs.
Algorithmica, 2015

2014
Minimal bricks have many vertices of small degree.
Eur. J. Comb., 2014

Cycles Are Strongly Ramsey-Unsaturated.
Comb. Probab. Comput., 2014

Partitioning two-coloured complete multipartite graphs into monochromatic paths.
CoRR, 2014

3-Colouring graphs without triangles or induced paths on seven vertices.
CoRR, 2014

Connectivity and tree structure in finite graphs.
Comb., 2014

2013
Forcing Large Complete (Topological) Minors in Infinite Graphs.
SIAM J. Discret. Math., 2013

Small degree vertices in minimal bricks.
Electron. Notes Discret. Math., 2013

2012
On claw-free t-perfect graphs.
Math. Program., 2012

2011
The relative degree and large complete minors in infinite graphs.
Electron. Notes Discret. Math., 2011

Stability in geodesics for memoryless binary long-lived consensus.
Electron. Notes Discret. Math., 2011

Extremal infinite graph theory.
Discret. Math., 2011

2010
Ends and Vertices of Small Degree in Infinite Minimally k-(Edge)-Connected Graphs.
SIAM J. Discret. Math., 2010

t-Perfection Is Always Strong for Claw-Free Graphs.
SIAM J. Discret. Math., 2010

Duality of Ends.
Comb. Probab. Comput., 2010

2009
Characterising claw-free t-perfect graphs.
Electron. Notes Discret. Math., 2009

2008
The Loebl-Komlós-Sós Conjecture for Trees of Diameter 5 and for Certain Caterpillars.
Electron. J. Comb., 2008

2007
Forcing highly connected subgraphs.
J. Graph Theory, 2007

An approximate version of the Loebl-Komlós-Sós conjecture.
Electron. Notes Discret. Math., 2007

On end degrees and infinite cycles in locally finite graphs.
Comb., 2007

2006
Arboricity and tree-packing in locally finite graphs.
J. Comb. Theory, Ser. B, 2006

MacLane's planarity criterion for locally finite graphs.
J. Comb. Theory, Ser. B, 2006

2005
Menger's theorem for infinite graphs with ends.
J. Graph Theory, 2005

Cycle-cocycle partitions and faithful cycle covers for locally finite graphs.
J. Graph Theory, 2005


  Loading...