Timeline for Lower bound for number of vertices in graph with certain forbidden minor
Current License: CC BY-SA 3.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 4, 2016 at 18:54 | vote | accept | Dominic van der Zypen | ||
| Aug 4, 2016 at 16:10 | answer | added | Tony Huynh | timeline score: 1 | |
| Aug 4, 2016 at 13:51 | comment | added | Dominic van der Zypen | Oh - thanks! Do you want to put this in an answer so I can accept&close this, or should I better delete the question? | |
| Aug 4, 2016 at 13:26 | comment | added | Tony Huynh | Well, in that case, $k+2$ is achievable. For example, if $n \geq 6$ is even, then $K_n$ minus a perfect matching does not have a $K_{n-1}$-minor. | |
| Aug 4, 2016 at 10:05 | history | edited | Dominic van der Zypen | CC BY-SA 3.0 |
added 59 characters in body
|
| Aug 4, 2016 at 10:00 | comment | added | Dominic van der Zypen | Maybe there is a misunderstanding. I am keen to know how many verices at least a graph satisfying 1. and 2. needs. Will edit question accordingly. | |
| Aug 4, 2016 at 9:08 | comment | added | Tony Huynh | Such a graph can be arbitrarily large, even for $k=4$. For example, there are arbitrarily large planar graphs with minimum degree $4$. | |
| Aug 4, 2016 at 7:00 | history | asked | Dominic van der Zypen | CC BY-SA 3.0 |