Compute the maximum number of non-homotopic simple closed curves that
can fit on a surface of small genus so that two curves intersect at most once
(or at most N times, for N small).
Focus on the special case where this family of curves contains a maximal family of non-intersecting curves (a pants decomposition).
Schedule: June-July 2014.
Difficulty level: Advanced / research level.
Tools: Programs in C++.
Results: [too be completed at the end of the project.]