{
"@context": "http://schema.org",
"@type": "ScholarlyArticle",
"@id": "https://doi.org/10.4230/lipics.stacs.2011.637",
"additionalType": "ConferencePaper",
"name": "Bounds on the maximum multiplicity of some common geometric graphs",
"author": [
{
"@type": "Person",
"name": "Adrian Dumitrescu",
"givenName": "Adrian",
"familyName": "Dumitrescu"
},
{
"@type": "Person",
"name": "Andre Schulz",
"givenName": "Andre",
"familyName": "Schulz"
},
{
"@type": "Person",
"name": "Adam Sheffer",
"givenName": "Adam",
"familyName": "Sheffer"
},
{
"@type": "Person",
"name": "Csaba D. Toth",
"givenName": "Csaba D.",
"familyName": "Toth"
}
],
"description": "We obtain new lower and upper bounds for the maximum multiplicity of some weighted, and respectively non-weighted, common geometric graphs drawn on $n$ points in the plane in general position (with no three points collinear): perfect matchings, spanning trees, spanning cycles (tours), and triangulations.\n\n(i) We present a new lower bound construction for the maximum number of triangulations a set of $n$ points in general position can have. In particular, we show that a generalized double chain formed by two almost convex chains admits Omega (8.65^n) different triangulations. This improves the bound Omega (8.48^n) achieved by the previous best construction, the double zig-zag chain studied by Aichholzer et al.\n\n(ii) We present a new lower bound of Omega(11.97^n) for the number of non-crossing spanning trees of the double chain composed of two convex chains. The previous bound, Omega(10.42^n), stood unchanged for more than 10 years.\n\n(iii) Using a recent upper bound of 30^n for the number of triangulations, due to Sharir and Sheffer, we show that n points in the plane in general position admit at most O(68.664^n) non-crossing spanning cycles.\n\n(iv) We derive exponential lower bounds for the number of maximum and minimum weighted geometric graphs (matchings, spanning trees, and tours). It was known that the number of longest non-crossing spanning trees of a point set can be exponentially large, and here we show that this can be also realized with points in convex position. For points in convex position we obtain tight bounds for the number of longest and shortest tours. We give a combinatorial characterization of the longest tours, which leads to an O(n log n) time algorithm for computing them.",
"version": "1.0",
"keywords": "Computer Science, {\"subject_scheme\"=>\"DDC\", \"text\"=>\"000 Computer science, knowledge, general works\"}",
"inLanguage": "eng",
"datePublished": "2011",
"schemaVersion": "http://datacite.org/schema/kernel-2.1",
"publisher": {
"@type": "Organization",
"name": "Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, Wadern/Saarbruecken, Germany"
},
"provider": {
"@type": "Organization",
"name": "DataCite"
}
}