Timeline for Minimum number of permutations of $\{1,\ldots, n\}$ that together contain every $k$-subpermutation
Current License: CC BY-SA 4.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 7, 2020 at 9:23 | vote | accept | Mark Wildon | ||
| Jan 24, 2019 at 15:34 | answer | added | Fedor Petrov | timeline score: 5 | |
| Jan 24, 2019 at 2:08 | comment | added | Mark Wildon | @Fedor Petrov: please could you make your comment, with a reference, into an answer? | |
| Jan 23, 2019 at 6:25 | history | edited | Mark Wildon | CC BY-SA 4.0 |
Added question about specific values
|
| Jan 23, 2019 at 5:17 | comment | added | Fedor Petrov | For fixed $k$ we have $c_1(k)\log n<f_k(n) <c_2(k)\log n$. But I do not know how sharp coefficient depends on $k$. | |
| Jan 23, 2019 at 4:42 | history | edited | Mark Wildon | CC BY-SA 4.0 |
Corrected duplicate in list for f_3(4)
|
| Jan 23, 2019 at 4:37 | comment | added | Sam Hopkins | With sets instead of permutations, this is known as the Erdos-Hanani conjecture, and is related to hypergraph packing; see: en.wikipedia.org/wiki/Packing_in_a_hypergraph | |
| Jan 23, 2019 at 4:29 | history | edited | Mark Wildon | CC BY-SA 4.0 |
edited title
|
| Jan 23, 2019 at 4:24 | history | asked | Mark Wildon | CC BY-SA 4.0 |