Timeline for Partitioning of a set family that avoids small intersections
Current License: CC BY-SA 4.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 18, 2022 at 13:18 | comment | added | wandering_lambda | Yes, thus an easy lower bound would be $\sum_{i=1}^3{n \choose i}$. | |
| Apr 18, 2022 at 6:27 | comment | added | Fedor Petrov | for the family of all subsets, all sets with at most three elements must be of different color, right? | |
| Apr 17, 2022 at 20:00 | history | edited | wandering_lambda | CC BY-SA 4.0 |
added 255 characters in body
|
| Apr 17, 2022 at 19:58 | comment | added | wandering_lambda | Yes, or any lower bound on it. | |
| Apr 17, 2022 at 19:56 | comment | added | bof | In other words, you want the chromatic number of the generalized Kneser graph $K(n,k,2)$. | |
| Apr 17, 2022 at 19:44 | history | asked | wandering_lambda | CC BY-SA 4.0 |