Embedding nearly spanning trees

DOI10.1017/S0963548325100084MaRDI QIDQ6879453zbMATH OpenFDO

Authors Bruce Reed, Maya Stein

Publication date 30 December 2025

Published in Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/S0963548325100084

zbMATH Keywords

average degreeErdős-Sós Conjecture

Mathematics Subject Classification ID

Trees (05C05) Vertex degrees (05C07) Extremal problems in graph theory (05C35) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Cites work

• A Local Approach to the Erdös--Sós Conjecture
• A variant of the Erdős-Sós conjecture
• Graph colouring and the probabilistic method
• scientific article; zbMATH DE number 3258067 (Why is no real title available?)
• Kalai's conjecture in \(r\)-partite \(r\)-graphs
• On Erdős-Sós conjecture for trees of large size
• On maximal paths and circuits of 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
• Spanning trees in graphs of high minimum degree with a universal vertex II: A tight result
• The Erdös-Sós conjecture for graphs of girth 5
• The Erdös-Sós conjecture for graphs without \(C_ 4\)
• Tree containment and degree conditions
• Tree embeddings

This page was built for publication: Embedding nearly spanning trees

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