Timeline for Need tight lower bound for independence number of order 10 graph
Current License: CC BY-SA 3.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 26, 2013 at 10:26 | answer | added | Craig Larson | timeline score: 1 | |
| Jan 26, 2013 at 1:52 | comment | added | Gerhard Paseman | Towards your goal of furthering new theory, you might present ten such minimal graphs and ask what else they may have in common; that might spur the development of new and better lower bounds. Gerhard "Ask Me About System Design" Paseman, 2013.01.25 | |
| Jan 26, 2013 at 1:05 | comment | added | Felix Goldberg | @AnthonyQuas: I think the OP is asking for a "principled" derivation of the fact that $\alpha=4$, not just for the calculation. It's a very interesting project... | |
| Jan 26, 2013 at 0:49 | comment | added | Gerhard Paseman | Try numerical order. I found such a set of 4 independent points. For such graphs, I find using the triangles helps. Gerhard "Ask Me About System Design" Paseman, 2013.01.25 | |
| Jan 26, 2013 at 0:13 | answer | added | Ami Paz | timeline score: 2 | |
| Jan 25, 2013 at 22:19 | comment | added | Felix Goldberg | Probably it won't fly, but the approach is worth looking at: tu-ilmenau.de/fileadmin/media/math/Preprints/2009/… | |
| Jan 25, 2013 at 22:09 | comment | added | Felix Goldberg | How did you get 3? I can't even do better than 2 :( | |
| Jan 25, 2013 at 21:37 | history | asked | Craig Larson | CC BY-SA 3.0 |