Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with asymptotics
Search options not deleted
user 4558
Asymptotic behavior of functions, asymptotic series and related topics
7
votes
1
answer
1k
views
How does the number of trees on $n$ vertices *up to isomorphism* grow as $n \to \infty$?
But what are the sharpest asymptotics, or best upper and lower bounds known, as $n \to \infty$?
Has anyone studied the number of homeomorphism types of trees on $n$ vertices? … Again, I don't expect an exact answer, and am mostly interested in the asymptotics as $n \to \infty$. …
- 7,857
7
votes
2
answers
211
views
Estimating the number of functions which are at most $c$-to-$1$ for some constant $c \ge 2$
I don't expect that there is an exact formula, and I am more interested in the asymptotics. …
- 7,857
16
votes
2
answers
2k
views
How many triangulations of the genus $g$ surface on $n$ vertices?
By "a triangulation of $X$", I mean a simplicial complex whose geometric realization is homeomorphic to $X$. Tutte showed that the number of combinatorially distinct triangulations $t(n)$ of the $2$-d …
- 7,857