Timeline for Minimizing the maximum degree of a set of sets
Current License: CC BY-SA 3.0
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 24, 2017 at 14:18 | comment | added | monkeymaths | Note that working in an arbitrary $F_p \times F_p$ for a prime number $p$ should yield a set $\mathcal{C}$ of lines with $m(\mathcal{C}) = p+1$, where the ground-set has size $n = p^2$. I don't know if the square root is optimal. | |
| Mar 23, 2017 at 11:35 | history | edited | Włodzimierz Holsztyński | CC BY-SA 3.0 |
typo
|
| Mar 23, 2017 at 11:08 | history | edited | Włodzimierz Holsztyński | CC BY-SA 3.0 |
a smaller example added
|
| Mar 23, 2017 at 11:03 | vote | accept | Dominic van der Zypen | ||
| Mar 23, 2017 at 10:47 | history | edited | Włodzimierz Holsztyński | CC BY-SA 3.0 |
a smaller example added
|
| Mar 23, 2017 at 10:30 | comment | added | Włodzimierz Holsztyński | I should get a minimal example as well (I just got distracted by editing above answer :) ). | |
| Mar 23, 2017 at 10:29 | history | edited | Włodzimierz Holsztyński | CC BY-SA 3.0 |
explicit set for (0 0)
|
| Mar 23, 2017 at 10:24 | history | edited | Włodzimierz Holsztyński | CC BY-SA 3.0 |
explanation
|
| Mar 23, 2017 at 10:18 | comment | added | Dominic van der Zypen | Can you describe this more concretely? I am afraid I don't understand your answer | |
| Mar 23, 2017 at 10:15 | history | answered | Włodzimierz Holsztyński | CC BY-SA 3.0 |