The extremal function for bipartite linklessly embeddable graphs (Q2288359)

In this present paper, the authors study the extremal problem of finding the maximum number of edges in a bipartite linklessly embeddable graph having \(n\) vertices.\par An embedding of a graph in \(\mathbb{R}^3\) is linkless if for every two disjoint cycles there exists an embedded ball that contains one of the cycles and is disjoint from the other. In the present paper, the authors prove that every bipartite linklessly embeddable (simple) graph on \(n \geq 5\) vertices has at most \(3n-10\) edges, unless it is isomorphic to the complete bipartite graph \(K_{3,n-3}\).