Geometriae Dedicata

, Volume 168, Issue 1, pp 221–233 | Cite as

Topological designs

  • Justin Malestein
  • Igor Rivin
  • Louis Theran
Original Paper


We give an exponential upper and a quadratic lower bound on the number of pairwise non-isotopic simple closed curves which can be placed on a closed surface of genus \(g\) such that any two of the curves intersects at most once. Although the gap is large, both bounds are the best known for large genus. In genus one and two, we solve the problem exactly. Our methods generalize to variants in which the allowed number of pairwise intersections is odd, even, or bounded, and to surfaces with boundary components.


Simple curves Surfaces Designs 

Mathematics Subject Classification

57M99 05B99 



JM, IR, and LT received support for this work from Rivin’s NSF CDI-I grant DMR 0835586. LT’s final preparation was supported by the European Research Council under the European Union’s Seventh Framework Programme (FP7/2007-2013) / ERC grant agreement no 247029-SDModels. Our initial work on this problem took place at Ileana Streinu’s 2010 Barbados workshop at the Bellairs Research Institute.


  1. 1.
    Aougab, T.: Large collections of curves pairwise intersecting exactly once. Preprint arXiv:1210.2797. (2012)
  2. 2.
    Birman, J.S., Hilden, H.M.: On the mapping class groups of closed surfaces as covering spaces. In: Advances in the theory of Riemann surfaces (Proc. Conf., Stony Brook, NY, 1969), pp. 81–115. Annals of Mathematical Studies, No. 66. Princeton University Press, Princeton, NJ (1971)Google Scholar
  3. 3.
    Brinkmann, G., McKay, B.D.: Fast generation of planar graphs. MATCH Commun. Math. Comput. Chem. 58(2), 323–357 (2007)zbMATHMathSciNetGoogle Scholar
  4. 4.
    Farb, B., Margalit, D.: A primer on mapping class groups, Princeton Mathematical Series, vol. 49. Princeton University Press, Princeton, NJ (2012)Google Scholar
  5. 5.
    Haas, A., Susskind, P.: The geometry of the hyperelliptic involution in genus two. Proc. Am. Math. Soc. 105(1), 159–165 (1989). doi: 10.2307/2046751 CrossRefzbMATHMathSciNetGoogle Scholar
  6. 6.
    Juvan, M., Malnič, A., Mohar, B.: Systems of curves on surfaces. J. Combin. Theory Ser. B 68(1), 7–22 (1996). doi: 10.1006/jctb.1996.0053 CrossRefzbMATHMathSciNetGoogle Scholar
  7. 7.
    Stinson, D.R.: Combinatorial designs. Springer, New York. Constructions and analysis, with a foreword by Charles J, Colbourn (2004)Google Scholar
  8. 8.
    Turán, P.: Eine Extremalaufgabe aus der Graphentheorie. Mat. Fiz. Lapok 48, 436–452 (1941)MathSciNetGoogle Scholar
  9. 9.
    Vu, V.H.: Extremal set systems with weakly restricted intersections. Combinatorica 19(4), 567–587 (1999). doi: 10.1007/s004939970008 CrossRefzbMATHMathSciNetGoogle Scholar

Copyright information

© Springer Science+Business Media Dordrecht 2013

Authors and Affiliations

  1. 1.Math DepartmentHebrew UniversityJerusalemIsrael
  2. 2.Math DepartmentTemple UniversityPhiladelphiaUSA
  3. 3.Institut für MathematikFreie Universität BerlinBerlinGermany

Personalised recommendations