conference paper
On the rectilinear crossing number of complete graphs
published
Uli
Wagner
author 36690CA2-F248-11E8-B48F-1D18A9856A870000-0002-1494-0568
SODA: Symposium on Discrete Algorithms
We prove a lower bound of 0.3288(4 n) for the rectilinear crossing number cr̄(Kn) of a complete graph on n vertices, or in other words, for the minimum number of convex quadrilaterals in any set of n points in general position in the Euclidean plane. As we see it, the main contribution of this paper is not so much the concrete numerical improvement over earlier bounds, as the novel method of proof, which is not based on bounding cr̄(Kn) for some small n.
SIAM2003
583 - 588
yes
U. Wagner, in:, SIAM, 2003, pp. 583–588.
Wagner U. On the rectilinear crossing number of complete graphs. In: SIAM; 2003:583-588.
Wagner, Uli. <i>On the Rectilinear Crossing Number of Complete Graphs</i>. SIAM, 2003, pp. 583–88.
U. Wagner, “On the rectilinear crossing number of complete graphs,” presented at the SODA: Symposium on Discrete Algorithms, 2003, pp. 583–588.
Wagner U. 2003. On the rectilinear crossing number of complete graphs. SODA: Symposium on Discrete Algorithms 583–588.
Wagner, U. (2003). On the rectilinear crossing number of complete graphs (pp. 583–588). Presented at the SODA: Symposium on Discrete Algorithms, SIAM.
Wagner, Uli. “On the Rectilinear Crossing Number of Complete Graphs,” 583–88. SIAM, 2003.
24222018-12-11T11:57:34Z2019-04-26T07:22:12Z