Timeline for Choosing subsets to cover larger sets
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 12, 2014 at 3:43 | history | edited | Włodzimierz Holsztyński | CC BY-SA 3.0 |
math typos
|
| Oct 12, 2014 at 3:28 | comment | added | bof | E.g., by Turán's theorem, $$f(2,3,n)=\binom n2-\lfloor\frac{n^2}4\rfloor=\binom{\lfloor\frac n2\rfloor}2+\binom{\lceil\frac n2\rceil}2$$ | |
| Oct 12, 2014 at 3:26 | comment | added | Włodzimierz Holsztyński | Right, this situation felt instantly familiar. (I'd written in the past a manuscript in which I generalized quite a bit Turán's theorem but it's gone, oh well). | |
| Oct 12, 2014 at 3:18 | comment | added | bof | The case $a=2$ is completely answered by Turán's theorem. (Of course, finding the maximum number of edges in a subgraph of $K_n$ containing no $K_b$ is equivalent to finding the minimum number of edges in a subgraph of $K_n$ containing at least one edge of each $K_b$-subgraph of $K_n$.) | |
| Oct 12, 2014 at 3:01 | history | answered | Włodzimierz Holsztyński | CC BY-SA 3.0 |