3 problems

Let $G$ be a graph, and let $mnl(G)$ denote the minimum number of links among spatial embeddings of $G$. A book embedding is a spatial embedding in which the graph is embedded with…

Let $K_{m,n}$ be a complete bipartite graph with independent vertex sets $\{a_1,\dots,a_m\}$ and $\{b_1,\dots,b_n\}$. Place $a_i$ at $(i,0)$ on the $x$-axis and $b_j$ at $(0,j)$ on…

Fleming–Mellor conjecture. For every graph $G$, some book representation of $G$ realizes the minimal number of non-trivial links possible in any embedding of $G$.