A Local Approach to the Erdös--Sós Conjecture
From MaRDI portal
(Redirected from Publication:4631099)
Abstract: A famous conjecture of ErdH{o}s and S'os states that every graph with average degree more than contains all trees with edges as subgraphs. We prove that the ErdH{o}s-S'os conjecture holds approximately, if the size of the embedded tree is linear in the size of the graph, and the maximum degree of the tree is sublinear.
Recommendations
- A localized Erdős-Kac theorem
- scientific article; zbMATH DE number 2124266
- A localized Erdős-Wintner theorem
- scientific article; zbMATH DE number 3885926
- On the Erd�s-S�s conjecture
- On the local approach to Sidorenko's conjecture
- A local version of Szpiro's conjecture
- scientific article; zbMATH DE number 7666713
- A variant of the Erdős-Sós conjecture
- A note on a result of Erdös, Sárkőzy and Sós
Cites work
- A skew version of the Loebl-Komlós-Sós conjecture
- An approximate version of the Loebl-Komlós-Sós conjecture
- Analytic combinatorics
- Constructing Trees in Graphs whose Complement has no K2,s
- Constructing trees in graphs with no K2,s
- Degree conditions for embedding trees
- scientific article; zbMATH DE number 3641497 (Why is no real title available?)
- scientific article; zbMATH DE number 1792598 (Why is no real title available?)
- Loebl-Komlós-Sós conjecture: dense case
- Maximum and minimum degree conditions for embedding trees
- 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 graphs on n=k+3 vertices.
- On the Erdős–Sós conjecture for trees with bounded degree
- On the Erd�s-S�s conjecture
- On the structure of linear graphs
- Proof of the \((n/2 - n/2 - n/2)\) conjecture for large \(n\)
- Proof of the Loebl-Komlós-Sós conjecture for large, dense graphs
- 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
- The approximate Loebl-Komlós-Sós conjecture. I: The sparse decomposition
- The Erdös-Sós conjecture for graphs of girth 5
- The Erdös-Sós conjecture for graphs without \(C_ 4\)
- The Erdős-Sós conjecture for spiders
- The Erdős-Sós conjecture for spiders of large size
- The Erdős‐Sós Conjecture for trees of diameter four
Cited in
(24)- A local strategy to decide the Alperin and Dade conjectures
- A proof of a conjecture of Erdős, Faudree, Rousseau and Schelp on subgraphs of minimum degree k
- A variation of the Erdős-Sós conjecture in bipartite graphs
- Tree embeddings
- On Erdős-Sós conjecture for trees of large size
- On the Erdős-Sós conjecture and graphs with large minimum degree.
- Counting trees in graphs
- scientific article; zbMATH DE number 1792598 (Why is no real title available?)
- A variant of the Erdős-Sós conjecture
- Maximum and minimum degree conditions for embedding trees
- Degree conditions for embedding trees
- The Erdős‐Sós Conjecture for trees of diameter four
- On the Erdős–Sós conjecture for trees with bounded degree
- A Spectral Erdős-Sós Theorem
- 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
- On the Erd\H{o}s-S\'os conjecture for trees with bounded degree
- How connectivity affects the extremal number of trees
- Embedding trees with maximum and minimum degree conditions
- Embedding nearly spanning trees
- Antidirected trees in dense digraphs
- How connectivity affects the extremal number of trees (extended abstract)
- Beyond the Erdős-Sós conjecture (extended abstract)
- Resilient forest universality in percolated dense graphs
This page was built for publication: A Local Approach to the Erdös--Sós Conjecture
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4631099)
