Jaroslav Nešetřil

From Wikipedia, the free encyclopedia

Jaroslav Nešetřil.
Jaroslav Nešetřil.

Jaroslav Nešetřil (b. March 13, 1946 in Brno) is a Czech mathematician, Charles University (Prague). His research areas include combinatorics (structural combinatorics, Ramsey theory), graph theory (coloring problems), algebra (representation of structures, categories, homomorphisms), posets (diagram and dimension problems), computer science (complexity, NP-completeness).

Nešetřil received his Ph.D. from Charles University in 1973.[1] He is responsible for more than 250 publications, was awarded the state prize (1985 jointly with Vojtěch Rödl) for a collection of papers in Ramsey theory, is a corresponding member of the German Academy of Sciences since 1996 and has been declared Doctor Honoris Causa of the University of Alaska (Fairbanks) in 2002.

[edit] Books

  • Hell, Pavol; Jaroslav Nešetřil (2004). Graphs and Homomorphisms (Oxford Lecture Series in Mathematics and Its Applications). Oxford University Press. ISBN 0198528175. 
  • Matoušek, Jiří; Jaroslav Nešetřil (1998). Invitation to Discrete Mathematics. Oxford University Press. ISBN 0198502079. 
  • Matoušek, Jiří; Jaroslav Nešetřil, H. Mielke (translator) (2002). Diskrete Mathematik: Eine Entdeckungsreise (in german). Springer. ISBN 3540423869. 
  • Matoušek, Jiří; Jaroslav Nešetřil (2006). Introduction aux mathématiques discrètes (in french). Springer. ISBN 228720010X. 
  • Nešetřil, Jaroslav; Vojtěch Rödl (1991). Mathematics of Ramsey Theory (Algorithms and Combinatorics, Vol. 5). Springer. ISBN 0387181911. 

[edit] References

  1. ^ Jaroslav Nešetřil at the Mathematics Genealogy Project

[edit] External links

Languages