Timeline for Can the bramble number and the strict bramble number of a graph be equal?
Current License: CC BY-SA 4.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 2, 2018 at 21:49 | vote | accept | Ralph Morrison | ||
| Aug 1, 2018 at 20:18 | answer | added | Jan Kyncl | timeline score: 3 | |
| Aug 1, 2018 at 2:20 | comment | added | Ralph Morrison | I agree; in fact, the strict bramble number for the square grid is exactly $k$, by results in the this thesis by Josse van Dobben de Bruyn: universiteitleiden.nl/binaries/content/assets/science/mi/… Indeed, the two numbers differ by exactly 1 for any rectangular grid. My hope is that this gap is always at least 1, for graphs that have at least 2 vertices. | |
| Jul 31, 2018 at 21:55 | comment | added | Jan Kyncl | For $k\ge 2$, the $k\times k$ square grid has bramble number $k+1$ and strict bramble number at least $k$. | |
| Jul 31, 2018 at 16:38 | comment | added | Ralph Morrison | You’re absolutely right! I edited the question to ask if there are any other graphs. | |
| Jul 31, 2018 at 16:37 | history | edited | Ralph Morrison | CC BY-SA 4.0 |
added 158 characters in body
|
| Jul 31, 2018 at 15:50 | comment | added | Arun Debray | If I understand everything correctly, when $G$ has a single vertex and no edges, both $\mathit{Br}(G)$ and $\mathit{sBr}(G)$ are equal to 1. | |
| Jul 31, 2018 at 15:25 | review | First posts | |||
| Jul 31, 2018 at 15:47 | |||||
| Jul 31, 2018 at 15:24 | history | asked | Ralph Morrison | CC BY-SA 4.0 |