| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4653849 | European Journal of Combinatorics | 2012 | 4 Pages |
Abstract
Improving a result of Károlyi, Pach and Tóth, we construct an arrangement of n segments in the plane with at most nlog8/log169 pairwise crossing or pairwise disjoint segments. We use the recursive method based on flattenable arrangements which was established by Larman, MatouÅ¡ek, Pach and TörÅcsik.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Jan KynÄl,