Timeline for Bounds for smallest non-trivial designs
Current License: CC BY-SA 4.0
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 2, 2023 at 14:14 | comment | added | Zach Hunter | in the statements of GKLO's theorems, they just say "$n_0$ is finite". but after a second look, it looks like their intermediate work should yield something quantitative (without excessive effort). I'll probably ask Prof. Keevash soon as well. | |
| Mar 2, 2023 at 13:26 | comment | added | Boris Bukh | The paper of Glock--Kühn--Lo--Osthus is quite explicit about bounds, see Theorem 1. I do not know whether there is anything better known. You probably should knock on Prof. Keevash's door and ask him directly. | |
| Mar 2, 2023 at 11:02 | history | asked | Zach Hunter | CC BY-SA 4.0 |