On the Crossing Number of 2-Page Book Drawings of $$K_{n}$$ with Prescribed Number of Edges in Each Page

We consider the problem of determining the 2-page book crossing number of the complete graph \( K_n \) when the number of edges in each page is given. We find upper and lower bounds of the right order of magnitude depending on the number of edges in the page with the least number of edges.