David 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,[1] and showed in 1974 that all claw-free graphs with an even number of vertices have perfect matchings.[2]

Sumner earned his doctorate from the University of Massachusetts Amherst in 1970, under the supervision of David J. Foulis.[3] He is a distinguished professor emeritus at the University of South Carolina.[4]

References

  1. ↑ Kühn, Daniela; Mycroft, Richard; Osthus, Deryk (2011), "A proof of Sumner's universal tournament conjecture for large tournaments", Proceedings of the London Mathematical Society, Third Series, 102 (4): 731–766, arXiv:1010.4430Freely accessible, doi:10.1112/plms/pdq035, MR 2793448, Zbl 1218.05034.
  2. ↑ Faudree, Ralph; Flandrin, Evelyne; Ryjáček, Zdeněk (1997), "Claw-free graphs — A survey", Discrete Mathematics, 164 (1–3): 87–147, doi:10.1016/S0012-365X(96)00045-3, MR 1432221.
  3. ↑ David Sumner at the Mathematics Genealogy Project
  4. ↑ Faculty & Staff Directory: David Sumner, University of South Carolina Department of Mathematics, retrieved 2015-08-30.

External links


This article is issued from Wikipedia - version of the 9/22/2015. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.