Expected-dimension conjecture for subdividing an edge in a graph

Let $G$ be a graph on $n-1$ vertices, and let $k\to l$ be an edge in $G$. Construct a graph $G'$ on $n$ vertices by subdividing the edge $k\to l$: add vertex $n$ and replace the edge $k\to l$ by the two edges $k\to n$ and $n\to l$. Edge-subdivision conjecture. If $G$ has the expected dimension, then $G'$ has the expected dimension as well. This conjecture proposes that expected dimension is preserved when an edge is subdivided; the preceding discussion gives a converse failure for a related construction, while the source does not specify a resolution of this conjecture.