Timeline for r-chromatic graphs with sufficient girth
Current License: CC BY-SA 3.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 4, 2016 at 0:46 | answer | added | Thomas Kalinowski | timeline score: 1 | |
| Jun 3, 2016 at 13:20 | comment | added | Yemon Choi | @ThomasKalinowski Why not leave this comment as an answer? | |
| S Jun 3, 2016 at 12:49 | history | suggested | Sean Lawton | CC BY-SA 3.0 |
Minor edits to LaTeX and formatting.
|
| Jun 3, 2016 at 12:39 | review | Suggested edits | |||
| S Jun 3, 2016 at 12:49 | |||||
| May 5, 2011 at 8:35 | comment | added | Thomas Kalinowski | If you want to get a graph that has girth at least $k$ and needs at least $r$ colors, take an $n$ (number of vertices) so large that $nr^{1+1/2k}\leqslant n^{1+1/2k}$ and apply your given inequality with $l=n/r$. | |
| May 5, 2011 at 8:05 | comment | added | user14875 | No it isnt homework. I am trying to read from a paper by Erdos. | |
| May 4, 2011 at 15:24 | comment | added | Thomas Kalinowski | Homework? mathoverflow.net/faq | |
| May 4, 2011 at 5:30 | history | asked | user14875 | CC BY-SA 3.0 |