Answers are grounded in this paper and cite their sources.
It is known that every optimal 1-planar graph has a K 6 -minor, and further the characterization of optimal 1-planar graphs without K 7 -minors has been established in previous studies. In this paper, we discuss the existence of subdivisions of complete graphs in optimal 1-planar graphs. We first prove that every optimal 1-planar graph has a K 6 -subdivision. Furthermore, we extend the problem to multigraphs, and show that the set of optimal 1-planar multigraphs having no K t -subdivision is the same as the set of optimal 1-planar multigraphs having no K t -minor for each t ≤ 6 . In addition, we show the smallest optimal 1-planar graph having a K 7 -subdivision, which has 17 vertices.
No takes yet. Share an insight, caveat, or question.
Masuda et al. (2026) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: