The induced‑path function f(n) for planar graphs is Θ(log n / log log n), confirming prior bounds. The paper was submitted 22 Sep 2025. Read more: https://getnews.me/new-bounds-on-induced-paths-in-planar-graphs-reveal-logarithmic-growth/ #planargraphs #inducedpaths

A new construction gives a (1+ε) distance‑approximating minor for planar and minor‑free graphs, sized Õε(k) and built with a near‑linear algorithm for fast processing. https://getnews.me/distance-approximating-minors-for-planar-minor-free-graphs/ #distanceapproximation #graphalgorithms #planargraphs