It is well known that not all graphs embed on the plane (e.g. the graph $K_{3,3}$). However, every finite graph embeds into a surface of some genus. One can think of this procedure as starting with a drawing of a graph on the plane and for each crossing one glues in a torus to resolve the intersection. So the takeaway is that adding 1-handles helps to resolve intersections. My question is:
Given a knot in the 3-ball, does it become trivial, i.e. it extends to an embedding of $D^2$, if we glue enough 1- and 2-handles? Can we use 2-handles to resolve crossings?
In my mind, these two problems, embedding graphs in $\mathbb{R}^2$ and embedding 2-disks with a given boundary knot in $\mathbb{R}^3$, are similar in the sense that both become solved when we stabilize by dimension, i.e. when we add an extra dimension to the target. In some sense, the obstructions to embedding graphs in the plane are local and so they vanish if we add "a small extra dimension" of room to resolve an intersection (much like blowing up resolves singularities.)
I am aware that this intuition is a bit sketchy but I would be curious to see any thoughts on this direction.