About: Read's conjecture

Facets (new session)
Description
Metadata
Settings
- Rule:
- Inverse Functional Properties:
- "Same As":

About: Read's conjecture Goto Sponge NotDistinct Permalink

An Entity of Type : owl:Thing, within Data Space : dbpedia.demo.openlinksw.com associated with source document(s)
QRcode icon

http://dbpedia.demo.openlinksw.com/describe/?url=http%3A%2F%2Fdbpedia.org%2Fresource%2FRead%27s_conjecture&invfp=IFP_OFF&sas=SAME_AS_OFF

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.

Attributes	Values
rdfs:label	リード予想 (ja) Read's conjecture (en)
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)
dcterms:subject	Conjectures that have been proved Graph theory
Wikipage page ID	71238169 (xsd:integer)
Wikipage revision ID	1110450200 (xsd:integer)
Link from a Wikipage to another Wikipage	Ronald C. Read Chromatic polynomial Algebraic geometry Graph theory Conjectures that have been proved Graph theory June Huh Unimodality dbr:S._G._Hoggar dbr:Strong_logarithmic_convcavity
sameAs	Read's conjecture Read's conjecture Read's conjecture
dbp:wikiPageUsesTemplate	dbt:Reflist dbt:Short_description dbt:Math-stub
has 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)
prov:wasDerivedFrom	wikipedia-en:Read's_conjecture?oldid=1110450200&ns=0
page length (characters) of wiki page	2689 (xsd:nonNegativeInteger)
foaf:isPrimaryTopicOf	wikipedia-en:Read's_conjecture
is Link from a Wikipage to another Wikipage of	June Huh Read-Hoggar conjecture
is Wikipage redirect of	Read-Hoggar conjecture
is foaf:primaryTopic of	wikipedia-en:Read's_conjecture

Faceted Search & Find service v1.17_git139 as of Feb 29 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 08.03.3330 as of Mar 19 2024, on Linux (x86_64-generic-linux-glibc212), Single-Server Edition (378 GB total memory, 59 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software