The crossing number of K₄,n on the real projective plane
From MaRDI portal
Publication:2576830
The author shows that the crossing number \(\text{cr}_{P^2}(K_{4,n})\) of the graph \(K_{4,n}\) on the projective plane is equal to \(\left\lfloor \frac{n}{3} \right\rfloor \left ( 2n-3\left ( 1 + \left\lfloor \frac{n}{3} \right \rfloor\right)\right )\); further, it is shown that for \(m \geq 4\), \(\frac{1}{9}{m \choose 2}{{n-2} \choose 2} \leq \text{cr}_{P^2}(K_{m,n}) \leq \frac{1}{4}{m \choose 2}{n \choose 2}\).
Recommendations
Cites work
Cited in
(13)- The crossing number of a projective graph is quadratic in the face-width
- The toroidal crossing number of \(K_{4,n}\)
- The splitting number of the complete graph in the projective plane
- 1-embeddability of complete multipartite graphs on the projective plane
- The crossing number of hexagonal graph \(H_{3,n }\) in the projective plane
- scientific article; zbMATH DE number 5128958 (Why is no real title available?)
- The crossing number of a projective graph is quadratic in the face–width
- A proof of the crossing number of K3,nin a surface
- The projective plane crossing number of C3 × Cn
- Turán's brick factory problem: the status of the conjectures of Zarankiewicz and Hill
- Drawings of complete graphs in the projective plane
- The projective plane crossing numbers of circular graphs
- The crossing number of the generalized Petersen graph P(3k,k) in the projective plane
This page was built for publication: The crossing number of \(K_{4,n}\) on the real projective plane
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2576830)