scientific article; zbMATH DE number 861349
From MaRDI portal
Publication:4871074
Cited in
(25)- An Erdős-Gallai type theorem for vertex colored graphs
- The approximate Loebl-Komlós-Sós conjecture and embedding trees in sparse graphs
- Degree conditions for forests in graphs
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems
- scientific article; zbMATH DE number 3931006 (Why is no real title available?)
- A remark on the loxodromic mapping conjecture
- scientific article; zbMATH DE number 1263285 (Why is no real title available?)
- Maximum and minimum degree conditions for embedding trees
- Degree conditions for embedding trees
- 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
- On the Erdős–Sós conjecture for trees with bounded degree
- An approximate version of the Loebl-Komlós-Sós conjecture
- An approximate version of the Loebl-Komlós-Sós conjecture
- Degree conditions on copies of forests in graphs
- Spanning trees in graphs of high minimum degree with a universal vertex I: An asymptotic result
- Spanning trees in graphs of high minimum degree with a universal vertex II: A tight result
- Dirac-type conditions for spanning bounded-degree hypertrees
- Embedding trees with maximum and minimum degree conditions
- Antidirected subgraphs of oriented graphs
- A potential degree sequence problem of the Loebl-Komlós-Sós conjecture
- Packing large balanced trees into bipartite graphs
- Semidegree, edge density and antidirected subgraphs (extended abstract)
- Loebl-Komlós-Sós conjecture: dense case
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)
