scientific article; zbMATH DE number 861349
From MaRDI portal
Publication:4871074
Cited in
(22)- Degree conditions for embedding trees
- An Erdős-Gallai type theorem for vertex colored graphs
- Maximum and minimum degree conditions for embedding trees
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems
- An approximate version of the Loebl-Komlós-Sós conjecture
- scientific article; zbMATH DE number 1263285 (Why is no real title available?)
- Spanning trees in graphs of high minimum degree with a universal vertex II: A tight result
- The approximate Loebl-Komlós-Sós conjecture and embedding trees in sparse graphs
- Loebl-Komlós-Sós conjecture: dense case
- Degree conditions for forests in graphs
- The approximate Loebl-Komlós-Sós conjecture. I: The sparse decomposition
- The approximate Loebl-Komlós-Sós conjecture II: The rough structure of LKS graphs
- The approximate Loebl-Komlós-Sós conjecture IV: Embedding techniques and the proof of the main result
- Degree conditions on copies of forests in graphs
- Dirac-type conditions for spanning bounded-degree hypertrees
- Embedding trees with maximum and minimum degree conditions
- An approximate version of the Loebl-Komlós-Sós conjecture
- Antidirected subgraphs of oriented graphs
- On the Erdős–Sós conjecture for trees with bounded degree
- Spanning trees in graphs of high minimum degree with a universal vertex I: An asymptotic result
- scientific article; zbMATH DE number 3931006 (Why is no real title available?)
- A remark on the loxodromic mapping conjecture
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4871074)