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 trees
Search options not deleted
user 36972
A tree is a connected graph without cycles, with a finite or infinite number of vertices. There are many variants of trees, according to further constraints or decorations.
7
votes
To what extent is it possible to generalise a natural bijection between trees and $7$-tuples...
A binary tree is either empty or made of two binary trees joined by a root, hence there is a "natural" bijection $\mathcal{T}\to 1+\mathcal{T}^2$ from the set $\mathcal{T}$ of all binary trees to the union … Note that the existence of this bijection implies that the number of septuplets of trees with $n$ nodes in total is less than the number of trees with $n+C$ nodes. …
- 630