Lesson plan
Read's conjecture
Read's conjecture is a conjecture, first made by Ronald Read, about the unimodality of the coefficients of chromatic polynomials in the context of graph theory. In 1974, S. G. Hoggar tightened this to the conjecture that the coefficients must be strongly log-concave. Hoggar's version of the conjecture is called the Read–Hoggar conjecture. The Read–Hoggar conjecture had been unresolved for more than 40 years before June Huh proved it in 2009, during his PhD studies, using methods from algebraic geometry.
Article summary
Read's conjecture is a conjecture, first made by Ronald Read, about the unimodality of the coefficients of chromatic polynomials in the context of graph theory. In 1974, S. G. Hoggar tightened this to the conjecture that the coefficients must be strongly log-concave. Hoggar's version of the conjecture is called the Read–Hoggar conjecture. The Read–Hoggar conjecture had been unresolved for more than 40 years before June Huh proved it in 2009, during his PhD studies, using methods from algebraic geometry.
Key claims
No claims recorded.
Discussion questions
- Summarise the article in your own words. Which single claim would you verify first, and why?
- Which claim in this article is most likely to be revised as the sources update? How would you check its current status?
- If two sources disagreed about one of these facts, what would you need in order to trust one over the other?
Bibliography
No sources recorded.
Key claims and bibliography are generated from the same tracked claims and sources as the article page.