The intersection graph of an orientable generic surface (Q2398831)

Let \(F\) be a compact surface and \(M\) a \(3\)-manifold (possibly with boundaries). If \(i:F\rightarrow M\) is a generic surface, then its \textit{intersection graph} \(M(i)\) is defined as the closure of the set \(\{p\in i(F): |i^{-1}(p)|>1\}\), i.e., \(M(i)\) is the set of all self-intersection points and singularities of the surface. If both \(F\) and \(M\) are oriented, then \(M(i)\) has the structure of a so-called \textit{arrowed daisy graph}. In [\textit{G.-S. Li}, Proc. Am. Math. Soc. 126, No. 12, 3721--3726 (1998; Zbl 0899.57018)], the following question was proposed: Which arrowed daisy graphs can be realized as the intersection graphs of oriented generic surfaces? In the paper under review, a complete characterization of such graphs is given. The author distinguishes two cases in the consideration, depending on whether or not all homology classes of \(M\) are of finite order. In the first case (when \(H_*(M)\) contains no element of infinite order), the key property of a realizable arrowed daisy graph turns out to be the existence of a certain kind of grading of its edges.