Timeline for Are all numbers from $1$ to $n!$ the number of perfect matchings of some bipartite graph?
Current License: CC BY-SA 3.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 18, 2016 at 10:52 | comment | added | user76479 | @TonyHuynh mathoverflow.net/questions/239152/…. | |
| May 18, 2016 at 4:26 | vote | accept | Turbo | ||
| Apr 20, 2016 at 9:35 | comment | added | Tony Huynh | @Turbo The sequence runs from $n!-(n-1)!+1$ to $n!-1$. For $n=3$, we have $n!-(n-1)!+2>n!-1$, so the sequence stops before reaching $n!-(n-1)!+2$ and contains exactly one term (which happens to be $5$). Note that we miss around $(n-1)!$ values of $f(G)$ just from this observation. | |
| Apr 20, 2016 at 8:48 | comment | added | Turbo | $n=3$ $n!-(n-1)!+2=3!-2!+2=6$ for which we have an example. | |
| Apr 20, 2016 at 8:44 | history | edited | Tony Huynh | CC BY-SA 3.0 |
added 119 characters in body
|
| Apr 20, 2016 at 8:42 | comment | added | Turbo | Interesting how many integers do we miss in $\mathcal N_{2n}$? | |
| Apr 20, 2016 at 8:40 | history | answered | Tony Huynh | CC BY-SA 3.0 |