Proves polylogarithmic edge lower bound guaranteeing k pairwise edge-disjoint geometrically non-crossing nested cycles for fixed k >= 3.
Cycles with many chords
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Polylogarithmic Bounds for Nested Cycles without Geometric Crossings
Proves polylogarithmic edge lower bound guaranteeing k pairwise edge-disjoint geometrically non-crossing nested cycles for fixed k >= 3.