Timeline for Lower bound for the size of a family of sets
Current License: CC BY-SA 4.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 23 at 7:49 | vote | accept | Fabius Wiesner | ||
| Sep 13 at 19:54 | comment | added | Fabius Wiesner | I mean the second paragraph regarding the sharp lower bound. | |
| Sep 13 at 11:53 | comment | added | Fabius Wiesner | Thank you. Could you elaborate how to get $2 \sqrt{m}$ from your second sentence? So far I got that $B_1' \cup A_1' = B_2' \cup A_1' = B_2' \cup A_2'$ implies $B_1' \setminus B_2' \subset A_1' \cap A_2'$, then $B_1' \setminus B_2' \subset A_1' \cap A_2' \cap B_1' = \emptyset$, then $B_1' \subseteq B_2'$. Then $B_2' \subseteq B_1'$ similarly. | |
| Sep 13 at 7:57 | history | answered | Ilya Bogdanov | CC BY-SA 4.0 |