The maximum number of edges of bipartite 1-planar graphs with 1-disk drawings

A graph is 1-planar if it admits a drawing in the plane such that each edge is crossed at most once. Let G be a bipartite 1-planar graph with bipartition sets X and Y. A 1-disk [Formula: see text] drawing of G is a 1-planar drawing such that all vertices of X lie on the boundary of [Formula: see text] and all vertices of Y and all edges of G locate in the interior of [Formula: see text], where [Formula: see text] is a disk on the plane. The concept was first proposed by Huang, Ouyang and Dong when they solved a conjecture about the edge density of bipartite 1-planar graphs. Additionally, they presented a problem of determining the maximum number of edges in a bipartite graph with a 1-disk [Formula: see text] drawing. In this paper, we solve this problem and prove that every bipartite graph G which has a 1-disk [Formula: see text] drawing has at most [Formula: see text] edges. Moreover, we demonstrate that this upper bound is tight, in the sense that there are infinitely many graphs for which this bound is attained exactly.