On the Erd�s-S�s conjecture

DOI10.1002/(SICI)1097-0118(199602)21:2%3C229::AID-JGT13%3E3.0.CO;2-EMaRDI QIDQ4865531zbMATH OpenOpenAlexFDO

Authors Mariusz Woźniak

Publication date 25 February 1996

Full work available at URL https://doi.org/10.1002/(sici)1097-0118(199602)21:2%3C229::aid-jgt13%3E3.0.co;2-e

zbMATH Keywords

Erdös-Sós conjecturetree

Mathematics Subject Classification ID

Trees (05C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• scientific article; zbMATH DE number 3885926
• scientific article; zbMATH DE number 1792598
• The Erdős-Sós conjecture for graphs whose complements contain no C₄
• The Erdös-Sós conjecture for graphs without \(C_ 4\)
• The Erdös-Sós conjecture for graphs of girth 5

Cited in

(48)

• A variation of a conjecture due to Erdös and Sós
• Subtrees and subforests of graphs
• On graphs which contain each tree of given size
• The Erdös-Sós conjecture for graphs without \(C_ 4\)
• Ramsey-nice families of graphs
• Local and mean Ramsey numbers for trees
• On a conjecture about trees in graphs with large girth
• The Erdős-Sós conjecture for graphs whose complements contain no C₄
• The Erdös-Sós conjecture for graphs of girth 5
• A variation of the Erdős-Sós conjecture in bipartite graphs
• On the Erdős-Sós conjecture for graphs with circumference at most k+1
• An Erdős-Gallai-type theorem for keyrings
• The Erdős-Sós conjecture for spiders
• The approximate Loebl-Komlós-Sós conjecture and embedding trees in sparse graphs
• Tree embeddings
• Erdős-type condition for a graph to contain k independent edges
• On Erdős-Sós conjecture for trees of large size
• Ramsey numbers for trees
• On fan-wheel and tree-wheel Ramsey numbers
• Turán numbers of multiple paths and equibipartite forests
• scientific article; zbMATH DE number 3885926 (Why is no real title available?)
• scientific article; zbMATH DE number 3863220 (Why is no real title available?)
• scientific article; zbMATH DE number 3941575 (Why is no real title available?)
• scientific article; zbMATH DE number 3957130 (Why is no real title available?)
• On the Erdős-Sós conjecture for graphs having no path with \(k+4\) vertices
• The Erdős-Sós conjecture for spiders of large size
• On the Loebl-Koml�s-S�s conjecture
• scientific article; zbMATH DE number 1792598 (Why is no real title available?)
• Embedding trees in graphs with independence number two
• On the Erdős-Sós conjecture for graphs on n = k + 4 vertices
• A Local Approach to the Erdös--Sós Conjecture
• scientific article; zbMATH DE number 812083 (Why is no real title available?)
• scientific article; zbMATH DE number 7339186 (Why is no real title available?)
• Bipartite version of the Erdös-Sós conjecture
• The approximate Loebl-Komlós-Sós conjecture. I: The sparse decomposition
• Constructing trees in graphs with no K_2,s
• A sufficient degree condition for a graph to contain all trees of size k
• The Erdős-Sós conjecture for geometric graphs
• An approximate version of the Loebl-Komlós-Sós conjecture
• A Spectral Erdős-Sós Theorem
• An \(A_{\alpha}\)-spectral Erdős-Sós theorem
• Proof of the \((n/2 - n/2 - n/2)\) conjecture for large \(n\)
• On the Erd\H{o}s-S\'os conjecture for trees with bounded degree
• How connectivity affects the extremal number of trees
• Spectral extremal results on trees
• How connectivity affects the extremal number of trees (extended abstract)
• A spectral Turán problem for a fixed tree
• Long paths with endpoints in given vertex-subsets of graphs

This page was built for publication: On 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 Q4865531)