Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Bounds on the maximum multiplicity of some common geometric graphs   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.
  (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 double zig-zag chain configuration studied by
Aichholzer et al.
  (ii) We present a new lower bound of {\Omega}(12.00^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.
  (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.62^n) non-crossing spanning cycles.
  (iv) We derive lower bounds for the number of maximum and minimum weighted
geometric graphs (matchings, spanning trees, and tours). We show that the
number of shortest non-crossing tours can be exponential in n. Likewise, we
show that both the number of longest non-crossing tours and the number of
longest non-crossing perfect matchings can be exponential in n. Moreover, we
show that there are sets of n points in convex position with an exponential
number of longest non-crossing spanning trees. 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(nlog
n) time algorithm for computing them.

11
The categories of this paper are: hep-lat
8
The categories of this paper are: hep-ex
37
The categories of this paper are: supr-con
9
The categories of this paper are: nlin
15
The categories of this paper are: nucl-ex
36
The categories of this paper are: cmp-lg
12
The categories of this paper are: nucl-th
20
The categories of this paper are: acc-phys
7
The categories of this paper are: hep-th
32
The categories of this paper are: atom-ph
3
The categories of this paper are: physics
26
The categories of this paper are: bayes-an
6
The categories of this paper are: astro-ph
33
The categories of this paper are: plasm-ph
21
The categories of this paper are: adap-org
19
The categories of this paper are: eess