Tuymaada pb
Source: Tuymaada 2004
June 29, 2005
combinatorics proposedcombinatorics
Problem Statement
In the plane are given 100 lines such that no 2 are parallel and no 3 meet in a point. The intersection points are marked. Then all the lines and k of the marked points are erased. Given the remained points of intersection for what max k one can reconstruct the lines?Proposed by A. Golovanov