Timeline for A strengthening of Frankl's union-closed conjecture?
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 7, 2014 at 11:57 | comment | added | Douglas Zare | For other parameters, every element is in the set, since there is an injection from sets not containing $x$ to sets containing $x$ by adding $x$. | |
| Apr 7, 2014 at 11:40 | comment | added | Nathann Cohen | (I mean that the most frequent elements are those I want and they do not form a set of $F$, but all other elements will all appear more than 50%) | |
| Apr 7, 2014 at 11:37 | comment | added | Nathann Cohen | I ran a couple of tests in Sage, which convinced me that the idea does not work :-) | |
| Apr 7, 2014 at 11:25 | comment | added | Douglas Zare | I think you mean $\ge k$. If so, then for $k=3, n=4$ this is not an example. $4 \in \lbrace 1,2,3,4 \rbrace,\lbrace 1,2,4 \rbrace, \lbrace 1,3,4\rbrace, \lbrace 2,3,4\rbrace$ so $4$ is in $4$ out of $7$ sets. $1$ and $3$ are in $5$ out of $7$. $2$ is in $6$ out of $7$. | |
| Apr 7, 2014 at 11:09 | history | answered | Nathann Cohen | CC BY-SA 3.0 |