The bipartite-forbidden-graph conjecture for accumulation points

For positive integers $s$ and $t$, let $K_{s,t}$ be the complete bipartite graph with parts of sizes $s$ and $t$, and let $\operatorname{Forb}(K_{s,t})$ denote the hereditary property of graphs with no induced forbidden member $K_{s,t}$. An accumulation point is a limit point of the edit distance function. Bipartite-forbidden-graph conjecture. For any $s,t\in\mathbb{N}$, $\operatorname{Forb}(K_{s,t})$ has no accumulation points in $(0,1]$. This extends the known result for the case treated earlier in the paper; the source notes that the conjecture requires methods beyond the existing argument, although it establishes absence of accumulation points on $[1/2,1]$.