The Erdős-Sós conjecture for spiders of large size
From MaRDI portal
Publication:393909
DOI10.1016/J.DISC.2013.07.021zbMATH Open1281.05048OpenAlexW2042398323WikidataQ123330319 ScholiaQ123330319MaRDI QIDQ393909FDOQ393909
Authors: Genghua Fan 
Publication date: 24 January 2014
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2013.07.021
Recommendations
Trees (05C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Graph theory
- On the Erd�s-S�s conjecture
- Packings of graphs and applications to computational complexity
- The Erdős-Sós conjecture for spiders
- On the Erdős-Sós conjecture for graphs on \(n=k+3\) vertices.
- Packing a tree with a graph of the same size
- Edge disjoint placement of graphs
- Long cycles and the codiameter of a graph. I
Cited In (14)
- Bounds on the burning numbers of spiders and path-forests
- Spectral extremal results on trees
- A variation of the Erdős-Sós conjecture in bipartite graphs
- The Erdős‐Sós Conjecture for trees of diameter four
- A spanning \(k\)-spider in a graph.
- The Erdős-Sós conjecture for spiders
- Title not available (Why is that?)
- The Erdős-Sós conjecture for spiders of four legs
- Title not available (Why is that?)
- On a conjecture of Nikiforov involving a spectral radius condition for a graph to contain all trees
- Embedding trees in graphs with independence number two
- On the Erdős-Sós conjecture and double-brooms
- A Local Approach to the Erdös--Sós Conjecture
- The Erdős-Sós conjecture for spiders of diameter 9
This page was built for publication: The Erdős-Sós conjecture for spiders of large size
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q393909)
