Read's conjecture
id:
read-s-conjecture-246-15659427
title:
Read's conjecture
text:
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 g
brand slug:
wiki
category slug:
encyclopedia
description:
Mathematical theorem first conjectured by Ronald Read
original url:
https://en.wikipedia.org/wiki/Read%27s_conjecture
date created:
date modified:
2024-01-03T02:35:22Z
main entity:
{"identifier":"Q112943558","url":"https://www.wikidata.org/entity/Q112943558"}
image:
fields total:
13
integrity:
14