The bipartite Turan number and spectral extremum for linear forests

Ming-Zhu Chen, Ning Wang, Long-Tu Yuan +1

The bipartite Turán number of a graph $H$, denoted by $ex(m,n;H)$, is the maximum number of edges in any bipartite graph $G=(X,Y;E)$ with $|X|=m$ and $|Y|=n$ which does not conta…