Improved Bounds on the Szeged-Wiener Gap and the BKLPS Conjecture

Bonamy-Knor-Lužar-Pinlou-Škrekovski (2017) define $K_n^t$ to be the complete graph of $n-1$ vertices but with an extra vertex that's adjacent to $t$ vertices of the complete graph part. They propose a stronger conjecture which asserts that if $G$ is a finite simple $2$-connected graph of order $n \g