Jaroslav Nešetřil

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

Jaroslav Nešetřil
Born March 13, 1946 (1946-03-13) (age 65)
Brno, Czechoslovakia
Residence Prague, Czech Republic
Nationality Czech
Fields Mathematician
Institutions Charles University, Prague
Alma mater Charles University, Prague
Doctoral advisor Aleš Pultr
Doctoral students Svatopluk Poljak, Jan Kratochvíl, Vladimír Puš, Ondřej Zýka, Jana Chlebíková, Robin Thomas, Martin Loebl, Igor Kříž, Martin Klazar, Pavel Valtr, Jiří Otta, Petra Špičková (Smolíková), Jana Maxová, Eva Milková, Robert Šámal, Martin Mareš, Jan Hubička, Diana Piquet, Zdeněk Dvořák, Martin Bálek, Veronika Douchová, Tomáš Valla.
Notable awards Silver medal of Union of Czechoslovak Mathematicians and Physicists (1977), State Prize of Czechoslovakia (jointly with V. Rödl) (1985), Doctor Honoris Causa of the University of Alaska (2002), Doctor Honoris Causa of the University of Bordeaux 1 (2009), Medal of Merit of Czech Republic (2010)

Jaroslav Nešetřil (Czech pronunciation: [ˈjaroslaf ˈnɛʃɛtr̝̊ɪl]; born March 13, 1946 in Brno) is a Czech mathematician, working at Charles University in Prague. His research areas include combinatorics (structural combinatorics, Ramsey theory), graph theory (coloring problems, sparse structures), 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 300 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. Since 2006, he is chairman of the Committee of Mathematics of Czech Republic (the Czech partner of IMU). He has also been declared Doctor Honoris Causa of the University of Bordeaux 1 in 2009; the speech he made in French at this occasion attracted a great deal of attention.[2] He received in 2010 the Medal of Merit of Czech Republic.[3]

He was an invited speaker of the European Congress of Mathematics, in Amsterdam, 2008,[4] and invited speaker (by both the Logic and Foundations and Combinatorics sections) at the Combinatorics session of the International Congress of Mathematicians, in Hyderabad, 2010.[5]

Jaroslav Nešetřil is Editor in Chief of Computer Science Review[6] and INTEGERS: the Electronic Journal of Combinatorial Number Theory.[7]

He also belongs to the Editorial Board of Commentationes Mathematicae Universitatis Carolinae,[8] Combinatorica,[9] Journal of Graph Theory,[10] Geocombinatorics, European Journal of Combinatorics,[11] Archivum Mathematicum,[12] and AKCE International Journal of Graphs and Combinatorics.[13] He used to belong to the Editorial Board of Journal of Combinatorial Theory Series B (1980–1986) and Random Structures & Algorithms (1988–2008).

Since 2008, Jaroslav Nešetřil belongs to the Advisory Board of the Academia Sinica.[14]

He has an Erdős number of 1.

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) (in german). Diskrete Mathematik: Eine Entdeckungsreise. Springer. ISBN 3540423869. 
  • Matoušek, Jiří; Jaroslav Nešetřil (2006) (in french). Introduction aux mathématiques discrètes. Springer. ISBN 228720010X. 
  • Nešetřil, Jaroslav; Vojtěch Rödl (1991). Mathematics of Ramsey Theory (Algorithms and Combinatorics, Vol. 5). Springer. ISBN 0387181911. 

References

  1. ^ Jaroslav Nešetřil at the Mathematics Genealogy Project.
  2. ^ "Échos de Talence", Sud Ouest. 2009, September 11th
  3. ^ List of the recipients of the Medal of Merit, Prague Castle Website. Accessed January 29, 2011
  4. ^ Program, ECM 2008. Accessed January 29, 2011
  5. ^ Invited Speakers for ICM2010, ICM 2010 Website. Accessed January 29, 2011
  6. ^ Editorial Board, Computer Science Review, Elsevier. Accessed January 29, 2011
  7. ^ Editorial Board, INTEGERS: the Electronic Journal of Combinatorial Number Theory. Accessed January 29, 2011
  8. ^ Editorial Board, Commentationes Mathematicae Universitatis Carolinae, Faculty of Mathematics and Physics of Charles University, Prague, Czech Republic. Accessed January 29, 2011
  9. ^ Editorial Board, Combinatorica, Springer-Verlag. Accessed January 29, 2011
  10. ^ Editorial Board, Journal of Graph Theory, John Wiley & Sons. Accessed January 29, 2011
  11. ^ Editorial Board, European Journal of Combinatorics, Elsevier. Accessed January 29, 2011
  12. ^ Editorial Board, Archivum Mathematicum, Faculty of Science of Masaryk University, Brno, Czech Republic. Accessed January 30, 2011
  13. ^ Editorial Board, AKCE International Journal of Graphs and Combinatorics, Kalasalingam University, Tamil Nadu, India. Accessed January 29, 2011
  14. ^ Advisory Board, Academia Sinica. Accessed January 29, 2011

External links


Wikimedia Foundation. 2010.

Игры ⚽ Поможем сделать НИР

Look at other dictionaries:

  • Jaroslav Nešetřil — Jaroslav „Jarik“ Nešetřil (* 13. März 1946 in Brünn) ist ein tschechischer Mathematiker, der sich mit Kombinatorik beschäftigt. Inhaltsverzeichnis …   Deutsch Wikipedia

  • Liste de personnes par nombre d'Erdős — Voici une liste non exhaustive de personnes ayant un nombre d Erdős de 0, 1 ou 2. Sommaire 1 #0 2 #1 3 #2 4 Référence …   Wikipédia en Français

  • Relation binaire — En mathématiques, une relation binaire entre deux ensembles E et F (ou simplement relation entre E et F) est caractérisée par un sous ensemble du produit cartésien E × F, soit une collection de couples dont la première composante est dans E et la …   Wikipédia en Français

  • Théorème de Jordan — En mathématiques, le théorème de Jordan est un théorème de topologie plane. Il est célèbre par le caractère apparemment intuitif de son énoncé et la difficulté de sa démonstration. « En fait, il n y a pratiquement aucun autre théorème qui… …   Wikipédia en Français

  • List of people by Erdős number — Paul Erdős was one of the most prolific writers of mathematical papers. He collaborated a great deal, having 511 joint authors, a number of whom also have many collaborators. The Erdős number measures the collaborative distance between an author… …   Wikipedia

  • Liste de personnes par nombre d'Erdos — Liste de personnes par nombre d Erdős Liste des personne avec un nombre d Erdős de 0, 1 ou 2. Sommaire 1 #0 2 #1 3 #2 4 Liens externes // …   Wikipédia en Français

  • Liste von Persönlichkeiten der Stadt Brünn — Die folgende Liste enthält die in Brünn geborenen sowie zeitweise lebenden Persönlichkeiten, chronologisch aufgelistet nach dem Geburtsjahr. Die Liste erhebt keinen Anspruch auf Vollständigkeit. Inhaltsverzeichnis 1 In Brünn geborene… …   Deutsch Wikipedia

  • Discrete mathematics — For the mathematics journal, see Discrete Mathematics (journal). Graphs like this are among the objects studied by discrete mathematics, for their interesting mathematical properties, their usefulness as models of real world problems, and their… …   Wikipedia

  • Minimum spanning tree — The minimum spanning tree of a planar graph. Each edge is labeled with its weight, which here is roughly proportional to its length. Given a connected, undirected graph, a spanning tree of that graph is a subgraph that is a tree and connects all… …   Wikipedia

  • Empty product — In mathematics, an empty product, or nullary product, is the result of multiplying no factors. It is equal to the multiplicative identity 1, given that it exists for the multiplication operation in question, just as the empty sum the result of… …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”