Hacker News new | past | comments | ask | show | jobs | submit login

Right—as mathematicians say, having a K_n subgraph is a sufficient but not necessary condition for having a chromatic number of at least n. Hadwiger’s conjecture goes the other way, stating that having a K_n minor is a necessary but not sufficient condition for having a chromatic number of at least n.



Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: