Timeline for Finding many disjoint sub-trees with many leaves

Current License: CC BY-SA 3.0

14 events

when toggle format	what		by	license	comment
Oct 17, 2016 at 0:45	history	bumped	CommunityBot		This question has answers that may be good or bad; the system has marked it active so that they can be reviewed.
Sep 17, 2016 at 0:34	history	bumped	CommunityBot		This question has answers that may be good or bad; the system has marked it active so that they can be reviewed.
Aug 18, 2016 at 0:03	history	bumped	CommunityBot		This question has answers that may be good or bad; the system has marked it active so that they can be reviewed.
Jul 18, 2016 at 23:08	history	bumped	CommunityBot		This question has answers that may be good or bad; the system has marked it active so that they can be reviewed.
Jun 18, 2016 at 22:58	history	bumped	CommunityBot		This question has answers that may be good or bad; the system has marked it active so that they can be reviewed.
May 19, 2016 at 22:49	history	bumped	CommunityBot		This question has answers that may be good or bad; the system has marked it active so that they can be reviewed.
S Dec 21, 2015 at 16:24	history	suggested	F. C.		added the tag trees
Dec 21, 2015 at 16:08	review	Suggested edits
S Dec 21, 2015 at 16:24
Dec 21, 2015 at 14:42	history	edited	Or Meir	CC BY-SA 3.0	added 93 characters in body
Dec 21, 2015 at 12:26	history	edited	Or Meir	CC BY-SA 3.0	Clarified further the notion that I need.
Dec 21, 2015 at 9:20	history	edited	Or Meir	CC BY-SA 3.0	Elaborated the definition following a comment.
Dec 21, 2015 at 9:17	comment	added	Or Meir		Sorry, tou are right - I meant leaves of the original tree.
Dec 20, 2015 at 22:23	comment	added	monkeymaths		When you require a subtree to have at least $\ell$ leaves, do you mean leaves \emph{of the original tree} or just any vertices which happen to be leaves in the subtree?
Dec 20, 2015 at 20:24	history	asked	Or Meir	CC BY-SA 3.0