Mathematicians have proved a graph-theory conjecture proposed in 2004. The proof shows that a difficult-to-analyze type of graph can be placed between two simpler graphs in a mathematically rigorous “sandwich.” It links two random graph processes, allowing researchers to study properties of the graph class through simpler comparison graphs [quantamagazine.org]. A separate advance uses multiscale sampling to improve approximate distance estimates for nearby points in massive networks, extending work on the all-pairs shortest-path problem that dates to 1996 [scitechdaily.com]. Sources: • Mathematicians Build Long-Awaited Graph Sandwich - quantamagazine.org • Computer Scientist Pushes a 1996 Algorithm Beyond Its Longstanding Limit - scitechdaily.com • Mathematicians Build Long-Awaited Graph Sandwich | Quanta Magazine - reddit.com --- 📰 Story aggregated by Kagi News