Timeline for Need tight lower bound for independence number of order 10 graph
Current License: CC BY-SA 3.0
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 26, 2013 at 1:02 | comment | added | Kevin P. Costello | It only works here if you happen to pick the right vertex of lowest degree to start with -- if you start by picking $5$, you'll only end up with a set of size $3$. | |
| Jan 26, 2013 at 0:21 | comment | added | Felix Goldberg | Nice! I used to think that this procedure produces the Caro-Wei bound, which I checked straight away and got only 2. Turns out that its stronger - this paper (pirate.shu.edu/~kahlnath/indnum.pdf) attributes the procedure and the resultant bound to Murphy (section 3). | |
| Jan 26, 2013 at 0:13 | history | answered | Ami Paz | CC BY-SA 3.0 |