Menu
Home
People
Places
Arts
History
Plants & Animals
Science
Life & Culture
Technology
Reference.org
Read's conjecture
open-in-new
<p>Read's conjecture is a conjecture, first made by <a href="/facts/Ronald_C._Read/Fzzeks3b">Ronald Read</a>, about the <a href="/facts/Unimodality/Xo3bhgeE">unimodality</a> of the coefficients of <a href="/facts/Chromatic_polynomial/dvr4Hyz9">chromatic polynomials</a> in the context of <a href="/facts/Graph_theory/VVPCd4TX">graph theory</a>. 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. </p><p>The Read–Hoggar conjecture had been unresolved for more than 40 years before <a href="/facts/June_Huh/Kq61rldd">June Huh</a> proved it in 2009, during his PhD studies, using methods from <a href="/facts/Algebraic_geometry/rh7RHVp3">algebraic geometry</a>. </p>