On a conjecture of Nikiforov involving a spectral radius condition for a graph to contain all trees
Abstract
We partly confirm a Brualdi-Solheid-Tur\'an type conjecture due to Nikiforov, which is a spectral radius analogue of the well-known Erdos-S\'os Conjecture that any tree of order t is contained in a graph of average degree greater than t-2. We confirm Nikiforov's Conjecture for all brooms and for a larger class of spiders. For our proofs we also obtain a new Tur\'an type result which might turn out to be of independent interest.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.