Timeline for Maximum number of edges $f(n,k)$ in a graph on $n$ vertices with no $k$-core?
Current License: CC BY-SA 4.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| S Oct 5, 2023 at 4:37 | history | suggested | The Amplitwist | CC BY-SA 4.0 |
fixed broken link to Wikipedia
|
| Oct 4, 2023 at 21:39 | review | Suggested edits | |||
| S Oct 5, 2023 at 4:37 | |||||
| Mar 2, 2013 at 15:03 | vote | accept | Matthew Kahle | ||
| Mar 1, 2013 at 18:42 | answer | added | Sergey Norin | timeline score: 8 | |
| Mar 1, 2013 at 18:40 | answer | added | j.c. | timeline score: 3 | |
| Mar 1, 2013 at 18:22 | history | edited | Matthew Kahle | CC BY-SA 3.0 |
corrected $\le k$ to $\ge k$.
|
| Mar 1, 2013 at 17:17 | comment | added | Gerhard Paseman | I think you want "of minimum degree >= k". Also, the literature on triangle free graphs may hint at an answer for f(n,3), even though it will only give an upper bound, and possibly a very weak bound. If you specialize to bipartite graphs, (I am guessing) you might also find some literature. Gerhard "Ask Me About System Design" Paseman, 2013.03.01 | |
| Mar 1, 2013 at 17:01 | history | asked | Matthew Kahle | CC BY-SA 3.0 |