Timeline for Hadwiger number of Erdös-Faber-Lovasz graphs
Current License: CC BY-SA 4.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 6, 2018 at 6:09 | history | edited | Dominic van der Zypen | CC BY-SA 4.0 |
False statement in the "Note" part of the question removed
|
| Sep 6, 2018 at 6:08 | comment | added | Dominic van der Zypen | @PhilippLampe You are right, I will remove the note (= last sentence in the post) | |
| Sep 5, 2018 at 14:25 | comment | added | Philipp Lampe | I cannot follow your "Note". Hadwiger's conjecture asserts that $\chi(G)\leq \eta(G)$. The section "History and partial results" of the wikipedia article you link to mentions a result of Chang and Lawler according to which $\chi(G)\leq \tfrac{3}{2}\eta(G)-2$. Both results provide lower bounds for $\eta(G)$, but the question asks for an upper bound. | |
| Jul 31, 2018 at 14:45 | history | edited | domotorp | CC BY-SA 4.0 |
changed = to <= for chromatic number of EFL
|
| Jul 31, 2018 at 14:18 | history | asked | Dominic van der Zypen | CC BY-SA 4.0 |