%0 Generic %1 Malestein2010 %A Malestein, Justin %A Rivin, Igor %A Theran, Louis %D 2010 %K asss %T Topological Designs %U http://arxiv.org/abs/1008.3710 %X Benson Farb and Chris Leininger had asked how many pairwise non-isotopic simple closed curves can be placed on a surface of genus g in such a way that any two of the curves intersect at most once. In this note we use combinatorial methods to give bounds (a lower bound of (g+1)g curves, and an exponential upper bound). While the bounds for the general Farb/Leininger question are (conjecturally) weak, the results presented here are of independent interest.

@misc{Malestein2010, abstract = { Benson Farb and Chris Leininger had asked how many pairwise non-isotopic simple closed curves can be placed on a surface of genus g in such a way that any two of the curves intersect at most once. In this note we use combinatorial methods to give bounds (a lower bound of (g+1)g curves, and an exponential upper bound). While the bounds for the general Farb/Leininger question are (conjecturally) weak, the results presented here are of independent interest. }, added-at = {2011-12-05T14:45:28.000+0100}, author = {Malestein, Justin and Rivin, Igor and Theran, Louis}, biburl = {https://www.bibsonomy.org/bibtex/2dd9e7f24df51444afcf3cc57dcc0d439/uludag}, description = {Topological Designs}, interhash = {578603d1c68184835dc629fed7f3b499}, intrahash = {dd9e7f24df51444afcf3cc57dcc0d439}, keywords = {asss}, note = {cite arxiv:1008.3710Comment: New version adds more references and a sharp result for genus 2}, timestamp = {2011-12-05T14:45:29.000+0100}, title = {Topological Designs}, url = {http://arxiv.org/abs/1008.3710}, year = 2010 }