The $2nd-$convex hull of every optimal rectilinear drawing of $K_{n}$ is a triangle

J. Lea\~nos; L. M. Rivera-Mart\'inez; M. Lomeli; M. Ram\'irez-Ib\'a\~nez

arxiv: 1411.1699 · v2 · pith:AUEETSOMnew · submitted 2014-11-02 · 🧮 math.MG · math.CO

The 2nd-convex hull of every optimal rectilinear drawing of K_(n) is a triangle

J. Lea\~nos , M. Lomeli , M. Ram\'irez-Ib\'a\~nez , L. M. Rivera-Mart\'inez This is my paper

classification 🧮 math.MG math.CO

keywords rectilineardrawingoptimalconvexeverygraphhulltriangle

0 comments

read the original abstract

A rectilinear drawing of a graph $G$ is optimal if it has the smallest number of crossings among all rectilinear drawings of $G$. In this paper it is shown that for $n\geq 8$, the second convex hull of every optimal rectilinear drawing of the complete graph $K_n$ is a triangle.

This paper has not been read by Pith yet.

The 2nd-convex hull of every optimal rectilinear drawing of K_(n) is a triangle

discussion (0)