Saturated triangulation-free convex geometric graphs can have as few as O(n log n) edges, and every edge count from that bound up to the maximum is achievable.
Step-1: Isolate the ”first sentence” (consider it complete when encountering the first period/question mark/ex- clamation mark/line break)
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
On saturated triangulation-free convex geometric graphs
Saturated triangulation-free convex geometric graphs can have as few as O(n log n) edges, and every edge count from that bound up to the maximum is achievable.