Jaroslav (Jarik) 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 under the supervision of Aleš Pultr and Gert Sabidussi.^[1] He is responsible for more than 300 publications.^[2] Since 2006, he is chairman of the Committee of Mathematics of Czech Republic (the Czech partner of IMU).

Jaroslav Nešetřil is Editor in Chief of Computer Science Review^[3] and INTEGERS: the Electronic Journal of Combinatorial Number Theory.^[4] He is also honorary editor of Electronic Journal of Graph Theory and Applications.^[5] Since 2008, Jaroslav Nešetřil belongs to the Advisory Board of the Academia Sinica.^[6]

He was awarded the state prize (1985 jointly with Vojtěch Rödl) for a collection of papers in Ramsey theory. The book Sparsity - Graphs, Structures, and Algorithms he co-authored with Patrice Ossona de Mendez was included in ACM Computing Reviews list of Notable Books and Articles of 2012.^[7]

Nešetřil 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. 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.^[8] He received in 2010 the Medal of Merit of Czech Republic^[9] and the Gold medal of Faculty of Mathematics and Physics, Charles University in 2011. In 2012, he has been elected to the Academia Europaea.^[10] Also, he has been elected honorary member of the Hungarian Academy of Sciences in 2013.^[11]

He was an invited speaker of the European Congress of Mathematics, in Amsterdam, 2008,^[12] 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.^[13]

In 2018, on the occasion of the 670th anniversary of the establishment of Charles University, Nešetřil has received from the rector of Charles university the Donatio Universitatis Carolinae prize “for his contribution to mathematics and for his leading role in establishing a world-renowned group in discrete mathematics at Charles University”.^[14]

Scholia has a profile for Jaroslav Nešetřil (Q956806).

• Hell, Pavol; Nešetřil, Jaroslav (2004). Graphs and Homomorphisms (Oxford Lecture Series in Mathematics and Its Applications). Oxford University Press. ISBN 0-19-852817-5.
• Matoušek, Jiří; Nešetřil, Jaroslav (1998). Invitation to Discrete Mathematics. Oxford University Press. ISBN 0-19-850207-9. 2008 2nd edition (hbk); 2009 2nd edition (pbk)
• Matoušek, Jiří; Nešetřil, Jaroslav (2002). Diskrete Mathematik: Eine Entdeckungsreise (in German). Translated by Mielke, Heinz. Springer. ISBN 3-540-42386-9.
• Matoušek, Jiří; Nešetřil, Jaroslav (2006). Introduction aux mathématiques discrètes (in French). Springer. ISBN 228720010X.
• Nešetřil, Jaroslav; Ossona de Mendez, Patrice (2012). Sparsity - Graphs, Structures, and Algorithms (Algorithms and Combinatorics, Vol. 28). Springer. ISBN 978-3-642-27874-7.
• Nešetřil, Jaroslav; Rödl, Vojtěch, eds. (1991). Mathematics of Ramsey Theory (Algorithms and Combinatorics, Vol. 5). Springer. ISBN 0-387-18191-1. 2012 pbk reprint