A Lower Bound for the Rectilinear Crossing Number
نویسندگان
چکیده
We give a new lower bound for the rectilinear crossing number cr(n) of the complete geometric graph Kn. We prove that cr(n) ≥ 14 ¥ n 2 ¦ ¥ n−1 2 ¦ ¥ n−2 2 ¦ ¥ n−3 2 ¦ and we extend the proof of the result to pseudolinear drawings of Kn.
منابع مشابه
An extended lower bound on the number of (k)-edges to generalized configurations of points and the pseudolinear crossing number of Kn
Recently, Aichholzer, Garćıa, Orden, and Ramos derived a remarkably improved lower bound for the number of (≤ k)-edges in an n-point set, and as an immediate corollary an improved lower bound on the rectilinear crossing number of Kn. We use simple allowable sequences to extend all their results to the more general setting of simple generalized configurations of points and slightly improve the l...
متن کاملNew Lower Bounds for the Number of (<=k)-Edges and the Rectilinear Crossing Number of Kn
We provide a new lower bound on the number of (≤ k)-edges of a set of n points in the plane in general position. We show that for 0 ≤ k ≤ bn−2 2 c the number of (≤ k)-edges is at least Ek(S) ≥ 3 ( k + 2 2 ) + k ∑ j=b3 c (3j − n + 3), which, for b3 c ≤ k ≤ 0.4864n, improves the previous best lower bound in [11]. As a main consequence, we obtain a new lower bound on the rectilinear crossing numbe...
متن کاملA ug 2 00 6 New lower bounds for the number of ( ≤ k ) - edges and the rectilinear crossing number of K n ∗
We provide a new lower bound on the number of (≤ k)-edges of a set of n points in the plane in general position. We show that for 0 ≤ k ≤ ⌊ 2 ⌋ the number of (≤ k)-edges is at least Ek(S) ≥ 3 (
متن کامل2 4 A ug 2 00 6 New lower bounds for the number of ( ≤ k ) - edges and the rectilinear crossing number of K n ∗
We provide a new lower bound on the number of (≤ k)-edges of a set of n points in the plane in general position. We show that for 0 ≤ k ≤ ⌊ 2 ⌋ the number of (≤ k)-edges is at least Ek(S) ≥ 3 (
متن کاملA Linear Upper Bound on the Rectilinear Crossing Number
It is proved that the rectilinear crossing number of every graph with bounded tree-width and bounded degree is linear in the num-
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Graphs and Combinatorics
دوره 21 شماره
صفحات -
تاریخ انتشار 2005