Embedding trees with maximum and minimum degree conditions

MaRDI QIDQ6621161FDOQ6621161

Authors: Guido Besomi, Matías Pavez-Signé, Maya Stein 

Publication date: 18 October 2024

Published in: Acta Mathematica Universitatis Comenianae. New Series (Search for Journal in Brave)

Recommendations

• Maximum and minimum degree conditions for embedding trees
• Degree conditions for embedding trees
• Tight bounds for embedding bounded degree trees
• Tree embeddings and tree‐star Ramsey numbers
• Embedding trees into graphs of large girth

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35)

Cites Work

• Proof of the Loebl-Komlós-Sós conjecture for large, dense graphs
• The Erdös-Sós conjecture for graphs without \(C_ 4\)
• The Erdös-Sós conjecture for graphs of girth 5
• Title not available (Why is that?)
• Title not available (Why is that?)
• 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 III: The finer structure of LKS graphs
• The approximate Loebl-Komlós-Sós conjecture IV: Embedding techniques and the proof of the main result
• An approximate version of the Loebl-Komlós-Sós conjecture
• Proof of the \((n/2 - n/2 - n/2)\) conjecture for large \(n\)
• Loebl-Komlós-Sós conjecture: dense case
• Title not available (Why is that?)
• A Local Approach to the Erdös--Sós Conjecture

This page was built for publication: Embedding trees with maximum and minimum degree conditions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6621161)