Timeline for Number of Ordered Trees of given degree sequence
Current License: CC BY-SA 3.0
16 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Mar 24, 2012 at 23:52 | comment | added | Aaron Meyerowitz | OK so I suppose a path of 5 vertices directed away from an end vertex has degrees 1,1,1,1,0 (counting number of children) but directed from an internal vertex 2,1,1,0,0. If that is correct then sequence of outdegrees would have been clearer to me. | |
Mar 24, 2012 at 21:04 | vote | accept | marc | ||
Mar 24, 2012 at 21:04 | history | edited | marc | CC BY-SA 3.0 |
added 2 characters in body
|
Mar 19, 2012 at 20:37 | answer | added | Ira Gessel | timeline score: 1 | |
Mar 19, 2012 at 15:02 | comment | added | GH from MO | @marc: Please define precisely the notion of ordered tree and ordered degree sequence (as I don't understand it) or give a reference to it. Thanks. | |
Mar 19, 2012 at 7:11 | comment | added | Vladimir Dotsenko | the question is not clear at all. could you please give an example of a degree sequence, and preferably (following Aaron's comment) of a case when the degree sequence does not define a unique tree? | |
Mar 19, 2012 at 6:03 | comment | added | Aaron Meyerowitz | so would degree sequence 2,1,3,4,5,1,1,1,1,1,1,1 mean the root has two children, the one on the left is a leaf and the one on the right has two children , one with 3 leaves on it and one with 4? That would uniquely specify the tree so it must not be that. Can you give an example? | |
Mar 19, 2012 at 4:57 | history | edited | marc | CC BY-SA 3.0 |
added 12 characters in body
|
Mar 19, 2012 at 4:36 | answer | added | GH from MO | timeline score: 0 | |
Mar 19, 2012 at 4:11 | history | edited | marc | CC BY-SA 3.0 |
added 115 characters in body
|
Mar 19, 2012 at 4:10 | comment | added | marc | @Gerhard Paseman sorry for the unclear specification: The degree sequence is ordered as well | |
Mar 19, 2012 at 3:35 | comment | added | Gerhard Paseman | And how is the degree sequence given? is it ordered as well? Or is it just a multiset? Gerhard "Ask Me About System Design" Paseman, 2012.03.18 | |
Mar 19, 2012 at 2:25 | history | edited | marc | CC BY-SA 3.0 |
edited body
|
Mar 19, 2012 at 1:24 | comment | added | marc | @Gerhard Paseman An ordered tree is a rooted tree in which the order of the subtrees is significant. | |
Mar 19, 2012 at 1:22 | comment | added | Gerhard Paseman | Ordered in what sense? Gerhard "Ask Me About System Design" Paseman, 2012.03.18 | |
Mar 19, 2012 at 0:23 | history | asked | marc | CC BY-SA 3.0 |