A spectral Turán problem for a fixed tree

DOI10.1016/J.LAA.2026.06.020MaRDI QIDQ7313447zbMATH OpenFDO

Authors Dheer Noal Sunil Desai, Hemanshu Kaul, Bahareh Kudarzi

Publication date 13 August 2026

Published in Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.LAA.2026.06.020

Mathematics Subject Classification ID

Trees (05C05) Enumeration in graph theory (05C30) Extremal problems in graph theory (05C35) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Structural characterization of families of graphs (05C75)

Cites work

• A bound on the spectral radius of graphs with \(e\) edges
• A new upper bound for the spectral radius of graphs with girth at least 5
• A spectral condition for odd cycles in graphs
• A spectral Erdős-Faudree-Rousseau theorem
• A Spectral Erdős-Sós Theorem
• Bounds on graph eigenvalues. II
• Connected graphs without long paths
• Eigenvalues of subgraphs of the cube
• scientific article; zbMATH DE number 3285073 (Why is no real title available?)
• scientific article; zbMATH DE number 3372065 (Why is no real title available?)
• On a conjecture of Nikiforov involving a spectral radius condition for a graph to contain all trees
• On Erdős-Sós conjecture for trees of large size
• On some extremal problems in graph theory
• On the Erdős-Sós conjecture for graphs on n=k+3 vertices.
• On the Erd�s-S�s conjecture
• On the spectral radii of graphs without given cycles
• On the Spectral Radius of Complementary Acyclic Matrices of Zeros and Ones
• On the spectral radius of graphs with a given domination number
• On the spectral radius of graphs with cut vertices
• On the structure of linear graphs
• Packing a tree with a graph of the same size
• Proof of a conjecture on the spectral radius of \(C_4\)-free graphs
• Spectral bounds for the clique and independence numbers of graphs
• Spectral extremal graphs for intersecting cliques
• Spectral extremal results on trees
• Spectral radius and Hamiltonicity of graphs
• Spectral radius conditions for the existence of all subtrees of diameter at most four
• Spectral supersaturation: triangles and bowties
• Spectral Turán problems for intersecting even cycles
• The Colin de Verdière parameter, excluded minors, and the spectral radius
• The Erdös-Sós conjecture for graphs without \(C_ 4\)
• The Erdős‐Sós Conjecture for trees of diameter four
• The history of degenerate (bipartite) extremal graph problems
• The maximum spectral radius of graphs without friendship subgraphs
• The spectral even cycle problem
• The spectral radius of graphs on surfaces
• The spectral radius of graphs with no intersecting odd cycles
• The spectral radius of graphs with no odd wheels
• The spectral radius of graphs without paths and cycles of specified length
• The spectral radius of graphs without trees of diameter at most four
• The spectral Turán problem about graphs with no 6-cycle
• Upper bounds on the spectral radius of book-free and/or \(K_{2,l}\)-free graphs

This page was built for publication: A spectral Turán problem for a fixed tree

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7313447)