Spectral extremal results with forbidding linear forests

DOI10.1007/S00373-018-1996-3zbMath1407.05145arXiv1801.06763OpenAlexW2963659950WikidataQ128825850 ScholiaQ128825850MaRDI QIDQ1733881

Xianqiang Yang

Publication date: 21 March 2019

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1801.06763

zbMATH Keywords

bipartite graphspectral radiuslinear forestspectral counterpartsTurán type extremal problem

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Distance in graphs (05C12)

Related Items (21)

Generalizing theorems of Nosal and Nikiforov: triangles and quadrilaterals ⋮ A spectral condition for the existence of the square of a path ⋮ On the spectral radius of graphs without a star forest ⋮ The maximum spectral radius of wheel-free graphs ⋮ A unique characterization of spectral extrema for friendship graphs ⋮ Spectral extrema of \(K_{s,t}\)-minor free graphs -- on a conjecture of M. Tait ⋮ The spectral Turán problem about graphs with no 6-cycle ⋮ The signless Laplacian spectral radius of graphs with forbidding linear forests ⋮ A strengthening of the spectral chromatic critical edge theorem: Books and theta graphs ⋮ The maximum spectral radius of graphs without spanning linear forests ⋮ An \(A_\alpha\)-spectral Erdős-Pósa theorem ⋮ The unique spectral extremal graph for intersecting cliques or intersecting odd cycles ⋮ Spectral radius conditions for the existence of all subtrees of diameter at most four ⋮ The bipartite Turán number and spectral extremum for linear forests ⋮ Spectral extrema of \(\{ K_{k + 1}, \mathcal{L}_s \}\)-free graphs ⋮ Spectral extremal problem on disjoint color-critical graphs ⋮ The spectral radius of minor-free graphs ⋮ The maximum spectral radius of graphs of given size with forbidden subgraph ⋮ Unnamed Item ⋮ Spectral extrema of graphs: forbidden hexagon ⋮ The spectral radius and \({\mathcal{P}}_{\ge \ell}\)-factors of graphs involving minimum degree

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the Turán number of forests
• Proof of a conjecture on the spectral radius of \(C_4\)-free graphs
• Some eigenvalue properties in graphs (conjectures of Graffiti -- II)
• A contribution to the Zarankiewicz problem
• The spectral radius of graphs without paths and cycles of specified length
• On the first eigenvalue of bipartite graphs
• The maximum spectral radius of \(C_4\)-free graphs of given order and size
• The spectral radius of graphs on surfaces
• A sharp upper bound of the spectral radius of graphs
• The Turán number of disjoint copies of paths
• Three conjectures in extremal spectral graph theory
• Bounds on graph eigenvalues. II
• A spectral condition for odd cycles in graphs
• On the eigenvalues of trees
• Turán Numbers of Multiple Paths and Equibipartite Forests
• Some Inequalities for the Largest Eigenvalue of a Graph
• On maximal paths and circuits of graphs
• A Spectral Erdős–Stone–Bollobás Theorem
• A proof for a conjecture of Gorgol

This page was built for publication: Spectral extremal results with forbidding linear forests