Timeline for What do you call a set of vertices that separates the root from the leaves?
Current License: CC BY-SA 4.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 22, 2020 at 0:58 | comment | added | Or Meir | The path contains a vertex from $M$. | |
| Mar 21, 2020 at 13:46 | comment | added | David G. Stork | Define "through." | |
| Mar 21, 2020 at 13:33 | comment | added | Or Meir | @DavidG.Stork The set $M$ may contain leaves. For example, note that if we choose $M$ to be the set of all leaves, then it indeed satisfies the property that every path from the root to a leaf passes through $M$. | |
| Mar 21, 2020 at 0:25 | comment | added | David G. Stork | How about "non-leaves"? | |
| Mar 19, 2020 at 8:37 | vote | accept | Or Meir | ||
| Mar 17, 2020 at 2:21 | comment | added | Jesko Hüttenhain | If this doesn't have a name yet, I recommend calling it a topping. | |
| Mar 17, 2020 at 2:14 | comment | added | Ryan Budney | If you want to keep the arborial metaphor going, perhaps "complete pruning" would be appropriate. | |
| Mar 17, 2020 at 0:18 | answer | added | RobPratt | timeline score: 2 | |
| Mar 16, 2020 at 23:43 | history | asked | Or Meir | CC BY-SA 4.0 |