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 answers only
not deleted
user 21684
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.
11
votes
Accepted
Normal subgroups of automorphism group of infinite cubic tree
Let $G_+$ be the index 2 subgroup of $G$, consisting of automorphisms which act on $T$ without inversions, which means that if such an automorphism preserves an edge, it fixes this edge pointwise. Equ …
- 31.2k
6
votes
Accepted
Embedding Euclidean buildings into products of trees
For instance, it is not unreasonable to expect that each locally finite Euclidean building $X$ admits a QI embedding into the product of $n$ simplicial trees of valence $3$, where $n$ depends on $X$. …
- 31.2k