Timeline for Given a constant k, find the biggest possible rooted tree, if for every path from root to leaf, the sum of the arity of its nodes equals k?
Current License: CC BY-SA 4.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 29, 2019 at 17:46 | vote | accept | Sudix | ||
| Jan 28, 2019 at 12:53 | comment | added | Sudix | @j_random_hacker Yes, you're completely right. I'll correct the question. | |
| Jan 28, 2019 at 12:52 | history | edited | Sudix | CC BY-SA 4.0 |
Edited appropiate to comment
|
| Jan 28, 2019 at 0:00 | history | tweeted | twitter.com/StackCompSci/status/1089674543743057921 | ||
| Jan 27, 2019 at 22:44 | answer | added | Hendrik Jan | timeline score: 4 | |
| Jan 27, 2019 at 16:38 | comment | added | j_random_hacker | You probably mean "every path from the root to a leaf", as otherwise the 1-vertex tree is the only solution. (Also it would be better to explicitly say that you're talking about a rooted tree -- unrooted trees are also possible.) | |
| Jan 27, 2019 at 12:38 | history | edited | Sudix | CC BY-SA 4.0 |
Answered the comment
|
| Jan 27, 2019 at 9:47 | comment | added | idoby | Define biggest. | |
| Jan 27, 2019 at 8:01 | history | asked | Sudix | CC BY-SA 4.0 |