The Erdős-Sós conjecture for spiders of large size
From MaRDI portal
(Redirected from Publication:393909)
Recommendations
Cites work
- Edge disjoint placement of graphs
- Graph theory
- Long cycles and the codiameter of a graph. I
- On the Erdős-Sós conjecture for graphs on \(n=k+3\) vertices.
- On the Erd�s-S�s conjecture
- Packing a tree with a graph of the same size
- Packings of graphs and applications to computational complexity
- The Erdős-Sós conjecture for spiders
Cited in
(14)- Bounds on the burning numbers of spiders and path-forests
- A variation of the Erdős-Sós conjecture in bipartite graphs
- Spectral extremal results on trees
- 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
- The Erdős-Sós conjecture for spiders of four legs
- scientific article; zbMATH DE number 6940851 (Why is no real title available?)
- scientific article; zbMATH DE number 7339186 (Why is no real title available?)
- 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)