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 10881
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.
3
votes
Grassmannian cluster algebra of infinite type has no trees in its mutation class
The quivers are almost trees, and only have one double edge and three oriented triangles. …
- 3,597
2
votes
Number of trees with the same matching number
This can be done using the canonical coloring of vertices of trees into 3 colors that can be found in
J. Zito, "The structure and maximum number of maximum independent sets in trees"
S. … Bauer, "On vertex covers, matchings and random trees"
Let me briefly define this coloring (using my own choice of colors). …
- 3,597
4
votes
Characteristic polynomials of trees and E8
Using sage, and up to 16 vertices included, one finds only two trees satisfying $|det(A+2I)|=1$, namely $E_8$ and $E_{10}$.
EDIT: I also confirm that there are 18 such trees with 18 vertices. …
- 3,597
3
votes
Is the following invariant of rooted trees a complete invariant?
The number of different values taken by the polynomial is given by
1, 1, 2, 4, 9, 20, 47, 112, 274, 679, 1717, ...
Comparing with the sequence A000081 given by
1, 1, 2, 4, 9, 20, 48, 115, 286, 719, …
- 3,597