Timeline for Existence of connected set with large edge boundary
Current License: CC BY-SA 4.0
11 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Aug 6, 2022 at 17:04 | history | bounty ended | CommunityBot | ||
Aug 4, 2022 at 9:10 | vote | accept | H A Helfgott | ||
Aug 4, 2022 at 9:10 | vote | accept | H A Helfgott | ||
Aug 4, 2022 at 9:10 | |||||
Aug 4, 2022 at 9:10 | comment | added | H A Helfgott | Ah, I think you are right. Thanks! | |
Aug 3, 2022 at 8:19 | history | edited | Florian Lehner | CC BY-SA 4.0 |
added 23 characters in body
|
Aug 3, 2022 at 6:54 | history | edited | Florian Lehner | CC BY-SA 4.0 |
added 11 characters in body
|
Aug 3, 2022 at 6:47 | comment | added | Florian Lehner | Redoing the calculations I still end up with the same numbers; I have now added the induction to my answer so you can tell me where you think it goes wrong. | |
Aug 3, 2022 at 6:46 | history | edited | Florian Lehner | CC BY-SA 4.0 |
added induction for the size of $G_k$
|
Aug 3, 2022 at 6:41 | history | edited | Florian Lehner | CC BY-SA 4.0 |
added 1069 characters in body
|
Aug 3, 2022 at 4:04 | comment | added | H A Helfgott | I didn't get why the number of edges of $G_k$ is $\frac{k+3}{2} 2^{2^{k+1}}$. To me, it looks more like $2^{2^k-1}+2^{2^k-1} \cdot 2^{2^{k-1}-1} + \dotsc$, whose dominant term is $2^{2^k-1} \cdot 2^{2^{k-1}-1} \dotsb 2^{2^2-1} |G_1| = 2^{2^{k+1}-k}$. | |
Aug 2, 2022 at 17:43 | history | answered | Florian Lehner | CC BY-SA 4.0 |