Two major ideas in the analysis of missing data are (a) the EM algorithm
[Dempster, Laird and Rubin, J. Roy. Statist. Soc. Ser. B 39 (1977) 1--38] for
maximum likelihood (ML) estimation, and (b) the formulation of models for the
joint distribution of the data ${Z}$ and missing data indicators ${M}$, and
associated "missing at random"; (MAR) condition under which a model for ${M}$
is unnecessary [Rubin, Biometrika 63 (1976) 581--592].
The {\it crossing number} of a graph $G$ is the minimum number of pairwise
intersections of edges in a drawing of $G$. The {\it $n$-dimensional folded
hypercube} $FQ_n$ is a graph obtained from $n$-dimensional hypercube by adding
all complementary edges. In this paper, we obtain upper and lower bounds of the
crossing number of $FQ_n$.