Timeline for vertex arboricity and chromatic number of triangle-free graphs
Current License: CC BY-SA 3.0
5 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Sep 28, 2017 at 14:13 | answer | added | Louis Esperet | timeline score: 3 | |
Sep 28, 2017 at 10:18 | comment | added | Yusuf Civan | If I'm not mistaken, a simple example in which the bound is sharp would be the Mycielskian $\mu(C_5)$ of the $5$-cycle $C_5$, as $va(\mu(C_5))=2$ and $\chi(\mu(C_5))=4$. | |
Sep 28, 2017 at 9:01 | comment | added | domotorp | What is the example that shows that this bound would be sharp? | |
Sep 28, 2017 at 8:59 | review | First posts | |||
Sep 28, 2017 at 9:18 | |||||
Sep 28, 2017 at 8:57 | history | asked | Yusuf Civan | CC BY-SA 3.0 |