Lower bounds on the number of crossing-free subgraphs of KN Export

@article{citeulike:2683239, abstract = {We improve previous lower bounds on the number of simple polygonizations, and other kinds of crossing-free subgraphs, of a set of N points in the plane by analyzing a suitable configuration. We also prove that the number of crossing-free perfect matchings and spanning trees is minimum when the points are in convex position.}, author = {Garc\'{\i}a, Alfredo and Noy, Marc and Tejel, Javier}, citeulike-article-id = {2683239}, citeulike-linkout-0 = {http://dx.doi.org/10.1016/S0925-7721(00)00010-9}, citeulike-linkout-1 = {http://www.sciencedirect.com/science/article/B6TYS-40TY72V-1/1/030af8fa5430d27ede9c21c7119e7d3d}, doi = {10.1016/S0925-7721(00)00010-9}, journal = {Computational Geometry}, keywords = {comp\_geometry, matching}, month = {August}, number = {4}, pages = {211--221}, posted-at = {2008-04-17 20:23:07}, priority = {2}, title = {Lower bounds on the number of crossing-free subgraphs of KN}, url = {http://dx.doi.org/10.1016/S0925-7721(00)00010-9}, volume = {16}, year = {2000} }

TY - JOUR ID - citeulike:2683239 L3 - citeulike-article-id:2683239 N2 - We improve previous lower bounds on the number of simple polygonizations, and other kinds of crossing-free subgraphs, of a set of N points in the plane by analyzing a suitable configuration. We also prove that the number of crossing-free perfect matchings and spanning trees is minimum when the points are in convex position. IS - 4 JF - Computational Geometry EP - 221 TI - Lower bounds on the number of crossing-free subgraphs of KN VL - 16 SP - 211 KW - comp_geometry KW - matching AU - García, Alfredo AU - Noy, Marc AU - Tejel, Javier PY - 2000/08// UR - http://dx.doi.org/10.1016/S0925-7721(00)00010-9 ER -