Timeline for What is the minimum size of a partial order containing all partial orders of size 5?
Current License: CC BY-SA 4.0
23 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| S Jan 10, 2021 at 12:49 | history | suggested | Jukka Kohonen | CC BY-SA 4.0 |
Updated OEIS link to published entry
|
| Jan 10, 2021 at 10:14 | review | Suggested edits | |||
| S Jan 10, 2021 at 12:49 | |||||
| Jan 10, 2021 at 4:36 | comment | added | LSpice | The name of the preprint @WillSawin referenced: Bonamy, Esperet, Groenland, and Scott - Optimal labelling schemes for adjacency,comparability and reachability. | |
| Jan 9, 2021 at 11:51 | answer | added | Dima Pasechnik | timeline score: 4 | |
| Jan 6, 2021 at 20:05 | comment | added | Caleb Stanford | @WillSawin I think editing to include it is a great idea. | |
| Jan 6, 2021 at 18:38 | comment | added | Will Sawin | The recent preprint arxiv.org/pdf/2012.01764.pdf gives a much more precise asymptotic (see Corollary 1.9). It was posted in answer to the linked question. Should this be included in the OEIS page? | |
| Jan 6, 2021 at 18:20 | answer | added | RobPratt | timeline score: 7 | |
| Jan 6, 2021 at 4:28 | comment | added | Brendan McKay | @RobPratt users.cecs.anu.edu.au/~bdm/data/digraphs.html | |
| Jan 6, 2021 at 2:45 | comment | added | Caleb Stanford | OEIS Sequence now published! Thanks everyone for the effort here! | |
| Jan 5, 2021 at 20:39 | comment | added | RobPratt | @BrendanMcKay Can you please provide the 318 6-posets? | |
| Jan 4, 2021 at 17:22 | history | edited | Caleb Stanford | CC BY-SA 4.0 |
added 81 characters in body
|
| Jan 4, 2021 at 17:21 | comment | added | Caleb Stanford | Cool. I have proposed it again at oeis.org/draft/A340318 | |
| Jan 4, 2021 at 16:17 | comment | added | Max Alekseyev | @6005: I this it's a good idea. | |
| Jan 4, 2021 at 15:32 | comment | added | Caleb Stanford | @MaxAlekseyev The sequence was recycled due to not having enough terms. It could be re-proposed now that we have f(5). | |
| Jan 4, 2021 at 13:39 | comment | added | Max Alekseyev | "This draft" link leads to a different sequence. | |
| Jan 4, 2021 at 11:01 | comment | added | Brendan McKay | If someone wants to do some programming, I can provide posets. Up to 11 points I can give you a gzipped file of about 140 MB. 12 points takes 3.1 GB which is more than my web server has free at the moment, but I could provide the generator program in C (you will need the 'nauty' package to compile it). | |
| Jan 3, 2021 at 21:31 | answer | added | Jukka Kohonen | timeline score: 18 | |
| Oct 30, 2020 at 17:07 | comment | added | Caleb Stanford | This may be useful: Posets on up to 16 points. I haven't found a list of them yet. | |
| Oct 30, 2020 at 16:34 | comment | added | Andrej Bauer | I can generate the 6-posets very easily myself, but sizes up to 11 seem like more of a challenge. Do you know if those are avialable anywhere? | |
| Oct 30, 2020 at 15:27 | comment | added | Henry | @AndrejBauer oeis.org/A000798/a000798_6.pdf has an illustration of the 318 6-posets. The first 63 of these are in effect the 5-posets if you ignore the left-hand isolated element | |
| Oct 27, 2020 at 21:17 | comment | added | Andrej Bauer | Is there a database of small posets? It looks like you could brute-force search sizes up to 11 if you had such a database. | |
| Oct 27, 2020 at 17:47 | history | edited | YCor |
edited tags; edited tags
|
|
| Oct 27, 2020 at 17:46 | history | asked | Caleb Stanford | CC BY-SA 4.0 |