Timeline for A new lower bound for the chromatic number of a graph?
Current License: CC BY-SA 3.0
22 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 11, 2017 at 11:15 | comment | added | j.c. | The above-cited paper of Clive Elphick and Pawel Wojcan seems to be this one: combinatorics.org/ojs/index.php/eljc/article/view/v20i3p39 . The paper of Ando and Lin is here web.uvic.ca/~linm/chromatic.pdf | |
| S Aug 20, 2015 at 8:13 | history | suggested | CommunityBot | CC BY-SA 3.0 |
correction to formula in last line
|
| Aug 20, 2015 at 7:44 | review | Suggested edits | |||
| S Aug 20, 2015 at 8:13 | |||||
| S Aug 19, 2015 at 15:43 | history | suggested | the_fox | CC BY-SA 3.0 |
fixed grammar, corrected spelling, improved formatting
|
| Aug 19, 2015 at 15:34 | review | Suggested edits | |||
| S Aug 19, 2015 at 15:43 | |||||
| S Aug 19, 2015 at 15:13 | history | suggested | CommunityBot | CC BY-SA 3.0 |
conjecture now proved
|
| Aug 19, 2015 at 14:48 | review | Suggested edits | |||
| S Aug 19, 2015 at 15:13 | |||||
| S Sep 14, 2013 at 18:40 | history | edited | Andrés E. Caicedo | CC BY-SA 3.0 |
Paper published in the Electronic jour
|
| S Sep 14, 2013 at 18:40 | history | suggested | CommunityBot | CC BY-SA 3.0 |
Paper published in the Electronic Journal of Combinatorics
|
| Sep 14, 2013 at 18:34 | review | Suggested edits | |||
| Sep 14, 2013 at 18:40 | |||||
| Nov 8, 2012 at 8:23 | comment | added | S. Carnahan♦ | In an answer that I have deleted, Clive wrote: "Pawel and I have submitted our paper to The Electronic Journal of Combinatorics. We do need to exclude the empty graph and the conjectured bound is unbounded because it is exact for complete graphs." | |
| Nov 8, 2012 at 8:22 | comment | added | S. Carnahan♦ | You should register an account, so you don't keep creating new user IDs. | |
| Sep 22, 2012 at 10:41 | comment | added | Jernej | You probably want the graph to have at least one edge otherwise $S−=0$. Also, is there a quick way to see that $S+/S−$ is unbounded? | |
| Sep 21, 2012 at 15:51 | comment | added | Gerhard Paseman | Stylistically, it is unclear to me which is better: to edit the question and provide a clearly marked update, or to submit an answer which contains an updated answer? Either is better than your current edit. I suggest adding the word "Update" to the start of the relevant paragraph. Gerhard "Ask Me About System Design" Paseman, 2012.09.21 | |
| Sep 21, 2012 at 14:17 | comment | added | Felix Goldberg | Just curious - to which journal did you submit the paper? | |
| Sep 21, 2012 at 13:41 | history | edited | Clive elphick | CC BY-SA 3.0 |
paper published about the conjecture on arXiv
|
| Jan 21, 2012 at 11:19 | history | edited | Clive elphick | CC BY-SA 3.0 |
further information about the conjecture
|
| Jan 17, 2012 at 21:29 | comment | added | Clive elphick | Dear Shahrooz, I have tested the conjecture against all named graphs in Wolfram Mathematica 8.0 with up to 50 vertices and found no counter-examples. I have proved the conjecture for KG(n:r) for r = 1,2,3,4. For r > 4 the algebra gets tortuous! What makes you think for large n and r there will be a counter-example? Thanks Clive | |
| Jan 17, 2012 at 18:20 | comment | added | Shahrooz | I think about Kneser graphs. We know that for Kneser graph $K_{n:r}$, $q=n-2r+2$ and $m=Cr(n,r)Cr(n-r,r)/2$. Also the eigenvalues of these graphs are determined and are $(-1)^i \times Cr(n-r-i,r-i)$. I think for suitable $n$(sufficiently large) and $r$ you can find a counter example for this inequality. | |
| Jan 17, 2012 at 17:50 | comment | added | Shahrooz | Dear Clive, did you test your inequality for any class of trees or $K_n -{e_1,e_2,...,e_t}$ for some suitable $t$? | |
| Jan 17, 2012 at 17:23 | history | edited | Clive elphick | CC BY-SA 3.0 |
further information about the conjecture
|
| Jan 7, 2012 at 12:37 | history | asked | Clive elphick | CC BY-SA 3.0 |