OP-0012Graph theoryOpen
Hadwiger's conjecture
Is every graph with no K t minor properly colourable with t − 1 colours?
Open Problem Garden· 1943
2 entries matching the current filters. Sorted by recently added.
Is every graph with no K t minor properly colourable with t − 1 colours?
In any finite union-closed family, must some element lie in at least half the sets?