The bipartite Turán number and spectral extremum for linear forests
From MaRDI portal
Publication:6178775
DOI10.1016/j.laa.2023.07.010arXiv2201.00453OpenAlexW4384207910WikidataQ123001426 ScholiaQ123001426MaRDI QIDQ6178775
Ming-Zhu Chen, Ning Wang, Long-Tu Yuan, Xiao Dong Zhang
Publication date: 5 September 2023
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2201.00453
Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30) Paths and cycles (05C38) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)
Cites Work
- Unnamed Item
- Unnamed Item
- On the Turán number of forests
- Turán numbers for disjoint copies of graphs
- Some eigenvalue properties in graphs (conjectures of Graffiti -- II)
- The spectral radius of graphs without paths and cycles of specified length
- Spectral bounds for the clique and independence numbers of graphs
- Cycles in bipartite graphs
- Degenerate Turán problems for hereditary properties
- Spectral extremal results with forbidding linear forests
- New asymptotics for bipartite Turán numbers
- Spectral extrema of graphs with fixed size: cycles and complete bipartite graphs
- The formula for Turán number of spanning linear forests
- Spectral conditions for the existence of specified paths and cycles in graphs
- The Turán number of disjoint copies of paths
- Spectral extrema for graphs: the Zarankiewicz problem
- On the eigenvalues of trees
- Some new results in extremal graph theory
- Turán Numbers of Multiple Paths and Equibipartite Forests
- On maximal paths and circuits of graphs
- An extremal problem for paths in bipartite graphs
- Turán Numbers of Bipartite Graphs and Related Ramsey-Type Questions
- An Upper Bound on Zarankiewicz' Problem
- Turán number of bipartite graphs with no 𝐾_{𝑡,𝑡}
- Turán Numbers of Bipartite Subdivisions
- The History of Degenerate (Bipartite) Extremal Graph Problems
- On the structure of linear graphs
- A proof for a conjecture of Gorgol
- Turán numbers for disjoint paths
This page was built for publication: The bipartite Turán number and spectral extremum for linear forests
