{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,17]],"date-time":"2026-03-17T23:29:59Z","timestamp":1773790199153,"version":"3.50.1"},"reference-count":0,"publisher":"The Electronic Journal of Combinatorics","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electron. J. Combin."],"abstract":"<jats:p>The spread of a graph $G$ is the difference between the largest and smallest eigenvalue of the adjacency matrix of $G$. In this paper, we consider the family of graphs which contain no $K_{s,t}$-minor. We show that for any $t\\geq s \\geq\u00a0 2$ and sufficiently large $n$, there is an integer $\\xi_{t}$ such that the extremal $n$-vertex $K_{s,t}$-minor-free graph attaining the maximum spread is the graph obtained by joining a graph $L$ on $(s-1)$ vertices to the disjoint union of $\\lfloor \\frac{2n+\\xi_{t}}{3t}\\rfloor$ copies of $K_t$ and $n-s+1 - t\\lfloor \\frac{2n+\\xi_t}{3t}\\rfloor$ isolated vertices. Furthermore, we give an explicit formula for $\\xi_{t}$ and an explicit description for the graph $L$ for $t \\geq \\frac32(s-3) +\\frac{4}{s-1}$.<\/jats:p>","DOI":"10.37236\/13410","type":"journal-article","created":{"date-parts":[[2025,1,17]],"date-time":"2025-01-17T17:45:58Z","timestamp":1737135958000},"source":"Crossref","is-referenced-by-count":1,"title":["Maximum Spread of $K_{s,t}$-Minor-Free Graphs"],"prefix":"10.37236","volume":"32","author":[{"given":"William","family":"Linz","sequence":"first","affiliation":[]},{"given":"Linyuan","family":"Lu","sequence":"additional","affiliation":[]},{"given":"Zhiyu","family":"Wang","sequence":"additional","affiliation":[]}],"member":"23455","published-online":{"date-parts":[[2025,1,17]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v32i1p5\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v32i1p5\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,17]],"date-time":"2025-01-17T17:45:59Z","timestamp":1737135959000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v32i1p5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,1,17]]},"references-count":0,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2025,1,17]]}},"URL":"https:\/\/doi.org\/10.37236\/13410","relation":{},"ISSN":["1077-8926"],"issn-type":[{"value":"1077-8926","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,1,17]]},"article-number":"P1.5"}}