Answers are grounded in this paper and cite their sources.
Recently, Wu, Wang, and Kong proved that every 1-planar graph without 5-cycles is 5-degenerate. In this paper, we strengthen their result by showing that every n -vertex 1-planar graph without 5-cycles has at most 3 n − 6 edges. We establish the same bound for 1-planar graphs without adjacent triangles. Consequently, both graph classes are 5-degenerate; for graphs without adjacent triangles, this improves a 2011 result of Hudák and Madaras establishing 6-degeneracy. The leading coefficient 3 in both edge bounds is asymptotically tight.
No takes yet. Share an insight, caveat, or question.
Dai et al. (2026) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: