In 2019 P. Patak and M. Tancer obtained the following higher-dimensional generalization of the Heawood inequality on embeddings of graphs into surfaces. We expose this result in a short well-structured way accessible to non-specialists in the field.Let ∆ k n be the union of k-dimensional faces of the n-dimensional simplex. Theorem. (a) If ∆ k n PL embeds into the connected sum of g copies of the Cartesian product. * We are grateful for useful discussions to R. Karasev and M. Tancer.