Timeline for minimal intersecting subsets
Current License: CC BY-SA 3.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 14, 2015 at 16:56 | comment | added | Daniel Soltész | An other proof would be by the Sauer-Shelah lemma. If we have more sets thean the above mentioned sum, the set system would shatter a set of size $k+2$. Thus it would have a (actually k+1) pair of sets that has intersection of size at least $k+1$. | |
| May 12, 2011 at 13:21 | comment | added | Roland Bacher | Indeed, I believe that question 2 is interesting for $m>k+1$. | |
| May 12, 2011 at 13:18 | comment | added | Martin Bächer | Thanks very much for that nice proof. Concerning question 2, i'd reckon the inequality isn't that strong though. | |
| May 12, 2011 at 13:17 | vote | accept | Martin Bächer | ||
| May 11, 2011 at 13:31 | history | edited | Roland Bacher | CC BY-SA 3.0 |
added 168 characters in body
|
| May 11, 2011 at 12:35 | history | edited | Roland Bacher | CC BY-SA 3.0 |
added 7 characters in body
|
| May 11, 2011 at 12:00 | history | answered | Roland Bacher | CC BY-SA 3.0 |