k-Sets, Convex Quadrilaterals, and the Rectilinear Crossing Number of Kn

13 years 11 months ago

We use circular sequences to give an improved lower bound on the minimum number of ( k)

József Balogh, Gelasio Salazar

Circular Sequences | DCG 2006 | General Position | Lower Bound |

claim paper

Added	11 Dec 2010
Updated	11 Dec 2010
Type	Journal
Year	2006
Where	DCG
Authors	József Balogh, Gelasio Salazar

Comments (0)