Timeline for Lower bound construction for the extremal number of $C_{2k}$-free bipartite graph
Current License: CC BY-SA 4.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 3, 2018 at 5:31 | comment | added | Brendan McKay | If $N=m+n$ and there no restrictions on $m$ and $n$, the unique extremal graph for $N\le 63$ is $K_{3,N-3}$. Clearly this doesn't continue forever, but when does the first exception occur? | |
| Oct 2, 2018 at 22:41 | answer | added | GMB | timeline score: 2 | |
| Oct 2, 2018 at 22:10 | history | edited | Kim | CC BY-SA 4.0 |
added 6 characters in body
|
| Oct 2, 2018 at 22:01 | history | asked | Kim | CC BY-SA 4.0 |