Number of triangular packings of a marked graph on a projective plane (Q1814064): Difference between revisions

Let \(G(T)\) be the graph of a triangulation \(T\) of the projective plane \(N_ 1\) and \(\tau(G(T),N_ 1)\) be the number of different triangular packings of the graph \(G(T)\) on \(N_ 1\). Exact upper estimates for the number \(\tau(G(T),N_ 1)\) have been obtained depending on the connectedness \(\kappa(G(T))\) of the graph \(G(T)\), all possible values of the connectedness being investigated.