About: David Sumner

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

About: David Sumner Goto Sponge NotDistinct Permalink

An Entity of Type : dbo:Person, 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%2FDavid_Sumner

David P. Sumner is an American mathematician known for his research in graph theory. He formulated Sumner's conjecture that tournaments are universal graphs for polytrees in 1971, and showed in 1974 that all claw-free graphs with an even number of vertices have perfect matchings. He and András Gyárfás independently formulated the Gyárfás–Sumner conjecture according to which, for every tree T, the T-free graphs are χ-bounded.

Attributes	Values
rdf:type	Thing person
rdfs:label	David Sumner (en)
rdfs:comment	David P. Sumner is an American mathematician known for his research in graph theory. He formulated Sumner's conjecture that tournaments are universal graphs for polytrees in 1971, and showed in 1974 that all claw-free graphs with an even number of vertices have perfect matchings. He and András Gyárfás independently formulated the Gyárfás–Sumner conjecture according to which, for every tree T, the T-free graphs are χ-bounded. (en)
dcterms:subject	University of South Carolina faculty Living people Place of birth missing (living people) Year of birth missing (living people) 20th-century American mathematicians University of Massachusetts Amherst alumni Graph theorists
Wikipage page ID	47676305 (xsd:integer)
Wikipage revision ID	1087266635 (xsd:integer)
Link from a Wikipage to another Wikipage	András Gyárfás University of South Carolina faculty Perfect matching University of Massachusetts Amherst University of South Carolina David J. Foulis Living people Place of birth missing (living people) Year of birth missing (living people) Claw-free graph 20th-century American mathematicians University of Massachusetts Amherst alumni Tournament (graph theory) Tree (graph theory) Graph theory Graph theorists Polytree Gyárfás–Sumner conjecture Sumner's conjecture Universal graph Χ-bounded
Link from a Wikipage to an external page	http://people.math.sc.edu/sumner/
sameAs	David Sumner David Sumner David Sumner
dbp:wikiPageUsesTemplate	dbt:Authority_control dbt:Reflist dbt:Short_description dbt:US-mathematician-stub
has abstract	David P. Sumner is an American mathematician known for his research in graph theory. He formulated Sumner's conjecture that tournaments are universal graphs for polytrees in 1971, and showed in 1974 that all claw-free graphs with an even number of vertices have perfect matchings. He and András Gyárfás independently formulated the Gyárfás–Sumner conjecture according to which, for every tree T, the T-free graphs are χ-bounded. Sumner earned his doctorate from the University of Massachusetts Amherst in 1970, under the supervision of David J. Foulis. He is a distinguished professor emeritus at the University of South Carolina. (en)
gold:hypernym	Mathematician
prov:wasDerivedFrom	wikipedia-en:David_Sumner?oldid=1087266635&ns=0
page length (characters) of wiki page	2398 (xsd:nonNegativeInteger)
foaf:isPrimaryTopicOf	wikipedia-en:David_Sumner
is Link from a Wikipage to another Wikipage of	András Gyárfás David J. Foulis List of people by Erdős number List of people named David Sumner, David Polytree Gyárfás–Sumner conjecture Sumner's conjecture
is Wikipage redirect of	Sumner, David
is foaf:primaryTopic of	wikipedia-en:David_Sumner

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