Strong 2-degenerate graph embeddings

DOI10.1142/S1793830923500076MaRDI QIDQ6551190zbMATH OpenFDO

Authors Peng Ying, Xia Zhang

Publication date 6 June 2024

Published in Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/S1793830923500076

zbMATH Keywords

codegreeembeddingstrong 2-degenerate graphs

Mathematics Subject Classification ID

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

Recommendations

• Large bounded degree trees in expanding graphs
• An algorithmic Friedman-Pippenger theorem on tree embeddings and applications
• Embedding nearly-spanning bounded degree trees
• Degree conditions for embedding trees
• Expanding graphs contain all small trees

Cites work

• Expanding graphs contain all small trees
• Hamiltonian circuits in random graphs
• scientific article; zbMATH DE number 881162 (Why is no real title available?)
• scientific article; zbMATH DE number 3258067 (Why is no real title available?)
• Loebl-Komlós-Sós conjecture: dense case
• On a conjecture about trees in graphs with large girth
• Proof of the Loebl-Komlós-Sós conjecture for large, dense graphs
• The approximate Loebl-Komlós-Sós conjecture and embedding trees in sparse graphs
• The Erdös-Sós conjecture for graphs without \(C_ 4\)
• The Erdős‐Sós Conjecture for trees of diameter four
• The Komlós conjecture for graphs of girth 7
• The Loebl-Komlós-Sós conjecture for trees of diameter 5 and for certain caterpillars
• Tree containment and degree conditions
• Tree embeddings

This page was built for publication: Strong 2-degenerate graph embeddings

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