Timeline for Counting labeled triangle-free graphs on $n$ vertices
Current License: CC BY-SA 3.0
5 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Jun 15, 2020 at 7:27 | history | edited | CommunityBot |
Commonmark migration
|
|
Feb 6, 2018 at 6:49 | history | edited | Peter Heinig | CC BY-SA 3.0 |
Additions, corrections.
|
Feb 6, 2018 at 6:26 | comment | added | Peter Heinig | @DouglasZare: their reference is mathoverflow.net/q/159494, without mentioning your answer therein. I searched the literature much, and I asked around, and by now I think it is most likely that that answer of yours is the first published reference for the lower bound. I will edit accordingly. I think that they should have mentioned you, but the behavior is well within what is acceptable (and perhaps they thought it more polite to not do so). My 'decades-old' was an example of en.wikipedia.org/wiki/False_precision, and it happened by writing in a hurry; I will change that, too. | |
Feb 3, 2018 at 0:01 | comment | added | Douglas Zare | What is their reference for the "decades old" lower bound? | |
Feb 2, 2018 at 21:13 | history | answered | Peter Heinig | CC BY-SA 3.0 |