Author:
Babai László,Guiduli Barry
Abstract
Let $G$ be a graph on $n$ vertices with spectral radius $\lambda$ (this is the largest eigenvalue of the adjacency matrix of $G$). We show that if $G$ does not contain the complete bipartite graph $K_{t ,s}$ as a subgraph, where $2\le t \le s$, then $$\lambda \le \Big((s-1)^{1/t }+o(1)\Big)n^{1-1/t }$$ for fixed $t$ and $s$ while $n\to\infty$. Asymptotically, this bound matches the Kővári-Turán-Sós upper bound on the average degree of $G$ (the Zarankiewicz problem).
Publisher
The Electronic Journal of Combinatorics
Subject
Computational Theory and Mathematics,Geometry and Topology,Theoretical Computer Science,Applied Mathematics,Discrete Mathematics and Combinatorics
Cited by
19 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Spectral Turán problems for intersecting even cycles;Linear Algebra and its Applications;2024-02
2. Spectral extrema of {Kk+1,Ls}-free graphs;Linear Algebra and its Applications;2024-02
3. The Index of Signed Graphs with Forbidden Subgraphs;Bulletin of the Malaysian Mathematical Sciences Society;2023-07-13
4. Spectral extrema of graphs with bounded clique number and matching number;Linear Algebra and its Applications;2023-07
5. On a conjecture of spectral extremal problems;Journal of Combinatorial Theory, Series B;2023-03