The following pages link to Maya Jakobine Stein (Q1010833):
Displaying 50 items.
- (Q256341) (redirect page) (← links)
- The approximate Loebl-Komlós-Sós conjecture and embedding trees in sparse graphs (Q256345) (← links)
- Partitioning 3-edge-coloured complete bipartite graphs into monochromatic cycles (Q324372) (← links)
- Partitioning two-coloured complete multipartite graphs into monochromatic paths and cycles (Q324825) (← links)
- Connectivity and tree structure in finite graphs (Q397061) (← links)
- On claw-free \(t\)-perfect graphs (Q431021) (← links)
- Complexity of splits reconstruction for low-degree trees (Q476307) (← links)
- Clique coloring \(B_1\)-EPG graphs (Q512582) (← links)
- \(b\)-coloring is NP-hard on co-bipartite graphs and polytime solvable on tree-cographs (Q747619) (← links)
- (Q897925) (redirect page) (← links)
- Convex \(p\)-partitions of bipartite graphs (Q897926) (← links)
- The Loebl-Komlós-Sós conjecture for trees of diameter 5 and for certain caterpillars (Q1010834) (← links)
- Almost partitioning 2-edge-colourings of 3-uniform hypergraphs with two monochromatic tight cycles (Q1689909) (← links)
- The domino problem on groups of polynomial growth (Q1747808) (← links)
- Partitioning 2-coloured complete \(k\)-uniform hypergraphs into monochromatic \(\ell\)-cycles (Q1750222) (← links)
- Three-coloring and list three-coloring of graphs without induced paths on seven vertices (Q1786047) (← links)
- Large immersions in graphs with independence number 3 and 4 (Q2132349) (← links)
- Better 3-coloring algorithms: excluding a triangle and a seven vertex path (Q2216431) (← links)
- Tree containment and degree conditions (Q2232047) (← links)
- Extremal infinite graph theory (Q2275380) (← links)
- Linear and projective boundaries in HNN-extensions and distortion phenomena (Q2342294) (← links)
- Geodesic stability for memoryless binary long-lived consensus (Q2353400) (← links)
- Monochromatic tree covers and Ramsey numbers for set-coloured graphs (Q2411628) (← links)
- Minimal bricks have many vertices of small degree (Q2441634) (← links)
- On end degrees and infinite cycles in locally finite graphs (Q2460629) (← links)
- MacLane's planarity criterion for locally finite graphs (Q2490251) (← links)
- Arboricity and tree-packing in locally finite graphs (Q2490258) (← links)
- Clique immersions and independence number (Q2674557) (← links)
- 3-colouring \(P_t\)-free graphs without short odd cycles (Q2696271) (← links)
- Monochromatic paths in 2-edge-coloured graphs and hypergraphs (Q2699642) (← links)
- List Edge-Coloring and Total Coloring in Graphs of Low Treewidth (Q2800543) (← links)
- The relative degree and large complete minors in infinite graphs (Q2840695) (← links)
- Stability in geodesics for memoryless binary long-lived consensus (Q2840734) (← links)
- Forcing Large Complete (Topological) Minors in Infinite Graphs (Q2848531) (← links)
- Characterising claw-free t-perfect graphs (Q2851509) (← links)
- <i>t</i>-Perfection Is Always Strong for Claw-Free Graphs (Q3008006) (← links)
- Ends and Vertices of Small Degree in Infinite Minimally <i>k</i>-(Edge)-Connected Graphs (Q3013149) (← links)
- Complexity of Splits Reconstruction for Low-Degree Trees (Q3104774) (← links)
- Forcing highly connected subgraphs (Q3437007) (← links)
- Monochromatic Cycle Partitions in Local Edge Colorings (Q3466360) (← links)
- Duality of Ends (Q3557524) (← links)
- A variant of the Erdős‐Sós conjecture (Q5110682) (← links)
- Maximum and Minimum Degree Conditions for Embedding Trees (Q5128507) (← links)
- Degree Conditions for Embedding Trees (Q5232383) (← links)
- The Approximate Loebl--Komlós--Sós Conjecture I: The Sparse Decomposition (Q5267992) (← links)
- The Approximate Loebl--Komlós--Sós Conjecture II: The Rough Structure of LKS Graphs (Q5267993) (← links)
- The Approximate Loebl--Komlós--Sós Conjecture III: The Finer Structure of LKS Graphs (Q5267994) (← links)
- The Approximate Loebl--Komlós--Sós Conjecture IV: Embedding Techniques and the Proof of the Main Result (Q5267995) (← links)
- Almost Partitioning a 3-Edge-Colored $K_{n,n}$ into Five Monochromatic Cycles (Q5270411) (← links)
- Almost partitioning 2‐colored complete 3‐uniform hypergraphs into two monochromatic tight or loose cycles (Q5379835) (← links)
