Timeline for Is there a n/2 version of the Erdős-Hanani conjecture?
Current License: CC BY-SA 3.0
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 13, 2017 at 12:57 | history | edited | CommunityBot |
replaced http://mathoverflow.net/ with https://mathoverflow.net/
|
|
| Feb 16, 2013 at 7:34 | comment | added | Sam Hopkins | @Gerhard Paseman: it looks like the repository has $n < 100$, $k \leq 25$ and $t \leq 8$. With such small values it is not possible to detect the presence or absence of a log factor. | |
| Feb 16, 2013 at 3:09 | comment | added | Brendan McKay | Some structural results on this part of the boolean lattice can be found with the search phrases "middle levels" and "boolean" together. For example, see the references in arxiv.org/pdf/math.CO/0608485.pdf . | |
| Feb 16, 2013 at 2:24 | history | edited | Sam Hopkins | CC BY-SA 3.0 |
explained the permutation idea better
|
| Feb 16, 2013 at 2:15 | comment | added | Sam Hopkins | I should mention also that the Graham-Sloane construction means that the EH-conjecture for $k = \phi(n)$ and $t = k - 1$ has a positive answer when $\phi(n) = o(n)$, so $n/2$ is in fact the "hard case." | |
| Feb 16, 2013 at 2:04 | comment | added | Sam Hopkins | @Brendan McKay: Yes, thank you. It is corrected. | |
| Feb 16, 2013 at 2:02 | history | edited | Sam Hopkins | CC BY-SA 3.0 |
corrected t vs. l typo; added 6 characters in body
|
| Feb 16, 2013 at 1:36 | comment | added | Brendan McKay | Does your description have $t$ and $l$ mixed up? If so, please edit. | |
| Feb 16, 2013 at 1:32 | comment | added | Gerhard Paseman | Have you checked out the La Jolla Covering Repository online? That might give a nice suggestion of what to expect. Gerhard "Ask Me About System Design" Paseman, 2013.02.15 | |
| Feb 16, 2013 at 1:02 | history | asked | Sam Hopkins | CC BY-SA 3.0 |