7 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 $G$ be a bipartite cubic planar graph, meaning that $G$ is bipartite, planar, and every vertex has degree three. A graph is dispersable if it has a proper $\Delta(G)$-edge-colo…

Let $K_n$ be the complete graph on $n$ vertices, let $\mathcal{E}_{c}(K_n)$ denote its complete expansion graph, and let $pn(G)$ be the pagenumber of a graph $G$. For a positive in…

Let $G$ be a bipartite graph that is $k$-regular. Its dispersable book thickness $dbt(G)$ is the minimum number of pages in a dispersable book embedding, and a graph is dispersable…

For a graph, book thickness is the minimum number of pages in a book embedding, and convex antithickness is the minimum number of convex geometric thrackles in a straight-line draw…

Blažek–Koman conjecture. For any positive integers $k$ and $n$,

Let $K_n$ be the complete graph on $n$ vertices, let $uk(Kn)$ denote its minimum number of crossings in a $k$-page book drawing, and let $Zk(n)$ denote the number of crossings in…