Timeline for Does a bounded branching/log depth dihotomy hold for rooted trees?
Current License: CC BY-SA 4.0
18 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| S Mar 31, 2019 at 17:41 | history | bounty ended | DmitryZ | ||
| S Mar 31, 2019 at 17:41 | history | notice removed | DmitryZ | ||
| Mar 31, 2019 at 11:29 | vote | accept | DmitryZ | ||
| S Mar 30, 2019 at 11:28 | history | suggested | Alex Ravsky |
Added a tag
|
|
| Mar 30, 2019 at 10:33 | answer | added | domotorp | timeline score: 4 | |
| Mar 30, 2019 at 10:29 | review | Suggested edits | |||
| S Mar 30, 2019 at 11:28 | |||||
| Mar 29, 2019 at 19:20 | comment | added | DmitryZ | @domotorp Yes, exactly that. | |
| Mar 29, 2019 at 8:17 | comment | added | domotorp | By binary tree, do you mean that every node should have at most two children? | |
| Mar 28, 2019 at 16:09 | comment | added | DmitryZ | Edited the conjecture into a more uniform statement | |
| Mar 28, 2019 at 16:08 | history | edited | DmitryZ | CC BY-SA 4.0 |
More succint reformulation
|
| Mar 28, 2019 at 15:55 | history | edited | DmitryZ | CC BY-SA 4.0 |
replace leaf-weight with a more common notation L(\cdot) denoting the number of leaves
|
| Mar 28, 2019 at 15:50 | history | edited | DmitryZ | CC BY-SA 4.0 |
replace leaf-weight with a more common notation L(\cdot) denoting the number of leaves
|
| Mar 28, 2019 at 15:50 | comment | added | DmitryZ | Thanks for the comment! It's the maximum over the leaves, edited the question. | |
| Mar 28, 2019 at 12:54 | comment | added | Louis Esperet | Is the branch-depth of a tree the maximum branch-depth of a vertex, or the minimum? | |
| S Mar 24, 2019 at 18:58 | history | bounty started | DmitryZ | ||
| S Mar 24, 2019 at 18:58 | history | notice added | DmitryZ | Draw attention | |
| Mar 22, 2019 at 13:29 | comment | added | DmitryZ | Perhaps this sort of argument can help mathoverflow.net/questions/280505/… | |
| Mar 21, 2019 at 12:16 | history | asked | DmitryZ | CC BY-SA 4.0 |