The density of maximal IC-plane graphs and maximal NIC-plane graphs
Abstract
In this paper, we show that any maximal IC-plane graph of order n has at least 73n-143 edges, and any maximal NIC-plane graph of order n has at least 115n-185 edges. Moreover, we show that both results are tight for infinitely many integers n.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.