An Upper Bound Asymptotically Tight for the Connectivity of the Disjointness Graph of Segments in the Plane

An Upper Bound Asymptotically Tight for the Connectivity of the Disjointness Graph of Segments in the Plane

Let <i>P</i> be a set of <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi>n</mi><mo>≥</mo><mn>3</mn></mrow></semantics></math></inlin...

Full description

Bibliographic Details
Main Authors: Aurora Espinoza-Valdez, Jesús Leaños, Christophe Ndjatchi, Luis Manuel Ríos-Castro
Format: Article
Language:English
Published: MDPI AG 2021-06-01
Series:Symmetry
Subjects:
disjointness graph of segments
rectilinear local crossing number
3-symmetry
Menger’s theorem
Hall’s theorem
Online Access:https://www.mdpi.com/2073-8994/13/6/1050

Internet

https://www.mdpi.com/2073-8994/13/6/1050

Similar Items