Timeline for Tree-chromatic number and Hadwiger number
Current License: CC BY-SA 3.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 2, 2016 at 19:41 | comment | added | Tony Huynh | @monkeymaths The random graph construction of graphs with large girth and high chromatic number also have high tree-chromatic number. This is not completely obvious, but follows from (1.1) of the above linked paper of Seymour. | |
| Feb 25, 2016 at 14:54 | history | edited | Dominic van der Zypen | CC BY-SA 3.0 |
edited body
|
| Feb 24, 2016 at 13:56 | comment | added | Dominic van der Zypen | @monkeymaths - I think some triangle-free graph $G$ with $\chi(G) > 4$ should do, but I have to check. Good question. I got the concept $\Upsilon(G)$ from the following paper but am not very familiar with it yet: web.math.princeton.edu/~pds/papers/treechi/paper.pdf | |
| Feb 24, 2016 at 13:56 | comment | added | Dominic van der Zypen | @FedorPetrov - it is the power set (set of all subsets) of the set of vertices $V(G)$ of $G=(V,E)$. | |
| Feb 24, 2016 at 13:18 | comment | added | Fedor Petrov | What is ${\mathcal P}(V(G))$? | |
| Feb 24, 2016 at 10:56 | comment | added | monkeymaths | Can you give an example where $\Upsilon(G)$ exceeds the maximum size of a clique? | |
| Feb 24, 2016 at 9:57 | history | asked | Dominic van der Zypen | CC BY-SA 3.0 |