| Article ID | Journal | Published Year | Pages | File Type | 
|---|---|---|---|---|
| 10225736 | Computational Geometry | 2018 | 10 Pages | 
Abstract
												Karasev conjectured that for any set of 3k lines in general position in the plane, which is partitioned into 3 color classes of equal size k, the set can be partitioned into k colorful 3-subsets such that all the triangles formed by the subsets have a point in common. Although the general conjecture is false, we show that Karasev's conjecture is true for lines in convex position. We also discuss possible generalizations of this result.
											Keywords
												
											Related Topics
												
													Physical Sciences and Engineering
													Computer Science
													Computational Theory and Mathematics
												
											Authors
												Seunghun Lee, Kangmin Yoo, 
											