About: Paul Seymour (mathematician)     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : yago:WikicatEnglishPeople, within Data Space : dbpedia.org associated with source document(s)
QRcode icon
http://dbpedia.org/describe/?url=http%3A%2F%2Fdbpedia.org%2Fresource%2FPaul_Seymour_%28mathematician%29

Paul D. Seymour FRS (born 26 July 1950) is a British mathematician known for his work in discrete mathematics, especially graph theory. He (with others) was responsible for important progress on regular matroids and totally unimodular matrices, the four colour theorem, linkless embeddings, graph minors and structure, the perfect graph conjecture, the Hadwiger conjecture, claw-free graphs, χ-boundedness, and the Erdős–Hajnal conjecture. Many of his recent papers are available from his website.

AttributesValues
rdf:type
rdfs:label
  • باول سايمور (أستاذ جامعي) (ar)
  • Paul Seymour (Mathematiker) (de)
  • Paul Seymour (mathématicien) (fr)
  • Paul Seymour (matematico) (it)
  • Paul Seymour (mathematician) (en)
  • Paul Seymour (matemático) (pt)
  • Сеймур, Пол (математик) (ru)
rdfs:comment
  • باول سايمور (بالإنجليزية: Paul Seymour)‏ هو رياضياتي بريطاني، ولد في 26 يوليو 1950 في بليموث في المملكة المتحدة. (ar)
  • Paul D. Seymour (* 26. Juli 1950 in Plymouth) ist ein englischer Mathematiker, der wichtige Beiträge zur Kombinatorik lieferte. (de)
  • Paul D. Seymour (Plymouth, 26 luglio 1950) è un matematico britannico, conosciuto per i contributi in matematica discreta, soprattutto negli ambiti della combinatoria, della teoria dei grafi e dell'ottimizzazione. (it)
  • Paul D. Seymour (né le 26 juillet 1950 à Plymouth) est un mathématicien britannique travaillant sur les mathématiques discrètes, en particulier la combinatoire, la théorie des graphes, et l'optimisation. Il est actuellement professeur à l'université de Princeton, aux États-Unis. (fr)
  • Paul D. Seymour (Plymouth (Devon), 26 de julho de 1950) é um matemático britânico conhecido por seu trabalho em matemática discreta, especialmente teoria dos grafos. (pt)
  • Paul D. Seymour FRS (born 26 July 1950) is a British mathematician known for his work in discrete mathematics, especially graph theory. He (with others) was responsible for important progress on regular matroids and totally unimodular matrices, the four colour theorem, linkless embeddings, graph minors and structure, the perfect graph conjecture, the Hadwiger conjecture, claw-free graphs, χ-boundedness, and the Erdős–Hajnal conjecture. Many of his recent papers are available from his website. (en)
  • Пол Сеймур (род. 26 июля 1950 года, Плимут, Великобритания) — британский и американский математик, профессор Принстонского университета, специалист по теории графов. Внёс большой вклад в изучение регулярных матроидов и полностью унимодулярных матриц, теоремы о четырёх цветах, бессвязных вложений, теоремы о минорах графа, гипотезы идеального графа, гипотезы Хадвигера и графов без клешней. (ru)
foaf:name
  • Paul Seymour (en)
name
  • Paul Seymour (en)
foaf:depiction
  • http://commons.wikimedia.org/wiki/Special:FilePath/PaulSeymour2010.jpg
  • http://commons.wikimedia.org/wiki/Special:FilePath/Paul_Seymour.jpeg
birth place
birth place
  • Plymouth, Devon, England (en)
birth date
dcterms:subject
Wikipage page ID
Wikipage revision ID
Link from a Wikipage to another Wikipage
Faceted Search & Find service v1.17_git139 as of Feb 29 2024


Alternative Linked Data Documents: ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 08.03.3330 as of Mar 19 2024, on Linux (x86_64-generic-linux-glibc212), Single-Server Edition (62 GB total memory, 43 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software