About: Read's conjecture

An Entity of Type: Thing, from Named Graph: http://dbpedia.org, within Data Space: dbpedia.org

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, tightened this to the conjecture that the coefficients must be . 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.

Property Value
dbo:abstract
  • 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, tightened this to the conjecture that the coefficients must be . 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. (en)
  • 数学におけるリード予想（リードよそう、英語: Read's conjecture）は、グラフ理論の文脈におけるの係数のに関する予想である。によって成された。 1974年、S. G. Hoggarはこの予想を、係数は強い対数凹でなければならない、とする予想へと絞った。本予想のHoggar版はリード＝Hoggar予想と呼ばれる。 リード＝Hoggar予想は40年以上証明されていなかったが、2009年に博士課程在籍中の許埈珥が代数幾何学の手法を使って証明した。 (ja)
dbo:wikiPageID
  • 71238169 (xsd:integer)
dbo:wikiPageLength
  • 2689 (xsd:nonNegativeInteger)
dbo:wikiPageRevisionID
  • 1110450200 (xsd:integer)
dbo:wikiPageWikiLink
dbp:wikiPageUsesTemplate
dcterms:subject
rdfs:comment
  • 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, tightened this to the conjecture that the coefficients must be . 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. (en)
  • 数学におけるリード予想（リードよそう、英語: Read's conjecture）は、グラフ理論の文脈におけるの係数のに関する予想である。によって成された。 1974年、S. G. Hoggarはこの予想を、係数は強い対数凹でなければならない、とする予想へと絞った。本予想のHoggar版はリード＝Hoggar予想と呼ばれる。 リード＝Hoggar予想は40年以上証明されていなかったが、2009年に博士課程在籍中の許埈珥が代数幾何学の手法を使って証明した。 (ja)
rdfs:label
  • リード予想 (ja)
  • Read's conjecture (en)
owl:sameAs
prov:wasDerivedFrom
foaf:isPrimaryTopicOf
is dbo:wikiPageRedirects of
is dbo:wikiPageWikiLink of
is foaf:primaryTopic of
Powered by OpenLink Virtuoso    This material is Open Knowledge     W3C Semantic Web Technology     This material is Open Knowledge    Valid XHTML + RDFa
This content was extracted from Wikipedia and is licensed under the Creative Commons Attribution-ShareAlike 3.0 Unported License