Skip to main content
4 events
when toggle format what by license comment
Nov 6, 2019 at 1:40 comment added RobPratt The generalization to an arbitrary set of keys for each door is apparently called the densest $k$-subhypergraph problem.
Nov 6, 2019 at 1:29 history edited david CC BY-SA 4.0
added 47 characters in body
Nov 6, 2019 at 1:25 review First posts
Nov 6, 2019 at 5:37
Nov 6, 2019 at 1:20 history answered david CC BY-SA 4.0