For the disjointness graph of segments determined by n points, the largest mutual-visibility set has size between C(n,2)-9 and C(n,2)-4 for large n, and both bounds are tight.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Mutual-visibility of the disjointness graph of segments in ${\mathbb R}^2$
For the disjointness graph of segments determined by n points, the largest mutual-visibility set has size between C(n,2)-9 and C(n,2)-4 for large n, and both bounds are tight.