scientific article; zbMATH DE number 861349

zbMATH Open0844.05037MaRDI QIDQ4871074FDOQ4871074

Authors: Miklós Ajtai, János Komlós, Endre Szemerédi 

Publication date: 18 August 1996

Title of this publication is not available (Why is that?)

zbMATH Keywords

treesdegreeconjecture of Loebl

Mathematics Subject Classification ID

Trees (05C05) Planar graphs; geometric and topological aspects of graph theory (05C10)

Cited In (22)

• 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
• Title not available (Why is that?)
• 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
• Title not available (Why is that?)
• A remark on the loxodromic mapping conjecture
• Degree conditions for embedding trees

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)