Jump to content

Read's conjecture

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by The Anome (talk | contribs) at 11:44, 6 July 2022 (oops). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

Read's conjecture is a conjecture about the unimodality of the coefficients of chromatic polynomials in the context of graph theory. It had been unresolved for more than 40 years before June Huh proved it in 2009, during his PhD studies.[1][2]

References

  1. ^ "He Dropped Out to Become a Poet. Now He's Won a Fields Medal". Quanta Magazine. 5 July 2022. Retrieved 5 July 2022.
  2. ^ Kalai, pp. 2–4.


Stub icon

This mathematics-related article is a stub. You can help Wikipedia by expanding it.

Retrieved from "https://en.wikipedia.org/w/index.php?title=Read%27s_conjecture&oldid=1096749844"