84 search results - page 1 / 17 » Asymptotic enumeration of orientations |
DMTCS
2010
13 years 2 months ago
2010
We find the asymptotic number of 2-orientations of quadrangulations with n inner faces, and of 3orientations of triangulations with n inner vertices. We also find the asymptotic n...
DM
2010
13 years 4 months ago
2010
A 2-cover is a multiset of subsets of [n] := {1, 2, . . . , n} such that each element of [n] lies in exactly two of the subsets. A 2-cover is called proper if all of the subsets o...
COMBINATORICS
2007
13 years 4 months ago
2007
We determine the exact and asymptotic number of unlabeled outerplanar graphs. The exact number gn of unlabeled outerplanar graphs on n vertices can be computed in polynomial time,...
CPC
1998
13 years 4 months ago
1998
We determine the asymptotic behaviour of the number of eulerian circuits in a complete graph of odd order. One corollary of our result is the following. If a maximum random walk, ...
CORR
2011
Springer
12 years 11 months ago
2011
Springer
We generalize the notion of non-crossing partition on a disk to general surfaces with boundary. For this, we consider a surface Σ and introduce the number CΣ(n) of noncrossing pa...