World's Best Scientists 2026 revealed!
Jaroslav Nešetřil

Jaroslav Nešetřil

Award Badge
Computer Science
Czechia
2026
Award Badge
Mathematics
Czechia
2026

D-Index & Metrics

Computer Science

D-Index
56
Citations
11932
World Ranking
4094
National Ranking
6

Mathematics

D-Index
57
Citations
12210
World Ranking
693
National Ranking
5

Research.com Recognitions

  • 2026 - Research.com Computer Science in Czechia Leader Award
  • 2026 - Research.com Mathematics in Czechia Leader Award
  • 2025 - Research.com Computer Science in Czechia Leader Award
  • 2025 - Research.com Mathematics in Czechia Leader Award
  • 2022 - Research.com Computer Science in Czechia Leader Award
  • 2012 - Member of Academia Europaea

Overview

Jaroslav Nešetřil is affiliated with Charles University in the Czech Republic. Their research spans across fields such as Computer Science and Mathematics, with a significant focus on Computational Theory and Mathematics, Discrete Mathematics and Combinatorics, and Geometry and Topology. Other subfields include Mathematical Physics and Electrical and Electronic Engineering.

The scientist's research topics cover a broad range including:

  • Advanced Graph Theory Research
  • Limits and Structures in Graph Theory
  • Advanced Topology and Set Theory
  • Complexity and Algorithms in Graphs
  • Computability, Logic, AI Algorithms
  • Semigroups and Automata Theory
  • Graph Labeling and Dimension Problems

Nešetřil has contributed to numerous publications, notably in venues such as:

  • arXiv (Cornell University)
  • European Journal of Combinatorics
  • European Conference on Combinatorics Graph Theory and Applications
  • Logical Methods in Computer Science
  • Journal of Combinatorial Theory Series B

Frequent collaborators include Patrice Ossona de Mendez, Sebastian Siebertz, Jan Hubička, Matěj Konečný, and Yiting Jiang.

Recent papers by Nešetřil include:

  • "A Unified Approach to Structural Limits and Limits of Graphs with Bounded Tree-Depth," 2020, Memoirs of the American Mathematical Society
  • "Clustering Powers of Sparse Graphs," 2020, The Electronic Journal of Combinatorics

Other recent notable papers related to their research area, though authored by collaborators, include:

  • "First-Order Interpretations of Bounded Expansion Classes," 2020, HAL (Le Centre pour la Communication Scientifique Directe)
  • "Ramsey properties and extending partial automorphisms for classes of finite structures," 2020, Fundamenta Mathematicae
  • "First-Order Interpretations of Bounded Expansion Classes," 2020, ACM Transactions on Computational Logic

In terms of book publications, Nešetřil has contributions published by Springer Nature, including the book "Extended Abstracts EuroComb 2021," which has received citations.

They have been recognized with an award as a Member of Academia Europaea, granted in 2012.

Best Publications

  • Graphs and homomorphisms

    Pavol Hell;Jaroslav Nešetřil

  • On the complexity of H -coloring

    Pavol Hell;Jaroslav Nešetřil

  • Otakar Boruvka on minimum spanning tree problem translation of both the 1926 papers, comments, history

    Jaroslav Nešetřil;Eva Milková;Helena Nešetřilová

  • Sparsity - Graphs, Structures, and Algorithms

    Unknown

  • On the complexity of the subgraph problem

    Jaroslav Nešetřil;Svatopluk Poljak

  • Tree-depth, subgraph coloring and homomorphism bounds

    Jaroslav Nešetřil;Patrice Ossona de Mendez

  • The core of a graph

    Pavol Hell;Jaroslav Nešetřil

  • Partitions of finite relational and set systems

    Jaroslav Nešetřil;Vojtěch Rödl

  • The Ramsey property for graphs with forbidden complete subgraphs

    Jaroslav Nešetřil;Vojtěch Rödl

  • Grad and classes with bounded expansion I. Decompositions

    Jaroslav Nešetřil;Patrice Ossona de Mendez

  • Bounded Height Trees and Tree-Depth

    Jaroslav Nešetřil;Patrice Ossona de Mendez

  • Ramsey theory

    Jaroslav Nešetřil

  • Duality Theorems for Finite Structures (Characterising Gaps and Good Characterisations)

    Jaroslav Nešetřil;Claude Tardif

  • Constraint Satisfaction with Countable Homogeneous Templates

    Manuel Bodirsky;Jaroslav Nešetřil

  • On nowhere dense graphs

    Jaroslav Nešetřil;Patrice Ossona de Mendez

  • Ramsey Classes and Homogeneous Structures

    Jaroslav Nešetřil

  • On the maximum average degree and the oriented chromatic number of a graph

    O.V. Borodin;A.V. Kostochka;J. Nešetřil;A. Raspaud

  • On classes of relations and graphs determined by subobjects and factorobjects

    Jaroslav Nešetřil;Aleš Pultr

  • Ramsey classes of set systems

    Jaroslav Nešetřil;Vojtěch Rödl

  • Duality and Polynomial Testing of Tree Homomorphisms

    P. Hell;J. Nesetril;X. Zhu

  • Grad and classes with bounded expansion II. Algorithmic aspects

    Jaroslav Nešetřil;Patrice Ossona de Mendez

  • Preface: graph colorings

    Jaroslav Nešetřil;Gerhard Woeginger

Frequent Co-Authors

Vojtěch Rödl
Vojtěch Rödl Emory University
Pavol Hell
Pavol Hell Simon Fraser University
André Raspaud
André Raspaud University of Bordeaux
Jiří Matoušek
Jiří Matoušek Charles University
Alexandr V. Kostochka
Alexandr V. Kostochka University of Illinois at Urbana-Champaign
Xuding Zhu
Xuding Zhu Zhejiang Normal University
Ron Graham
Ron Graham University of California, San Diego
Vasek Chvátal
Vasek Chvátal Concordia University
Robin Thomas
Robin Thomas Georgia Institute of Technology
Paul Erdös
Paul Erdös Hungarian Academy of Sciences

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

For students studying Mathematics in the USA, exploring related online degrees can broaden career opportunities, especially in finance, marketing, and business management. Many professionals leverage their mathematical skills to transition into specialized graduate programs that enhance both knowledge and marketability.

For example, pursuing a masters in finance online programs is an excellent option for those interested in quantitative finance, risk analysis, and investment strategies. These programs often combine advanced math with practical financial applications.

Students aiming to fast-track their education and career growth can consider enrolling in the shortest mba program online. This path allows mathematical professionals to gain leadership and management skills in a condensed timeframe while balancing work and study.

Marketing is another field where analytical skills are highly valued. Accessing marketing graduate programs online offers flexible, cost-effective ways to blend mathematics with market analytics and consumer behavior insight.

Additionally, the cheapest 1 year online mba programs provide an affordable option to gain essential business acumen quickly, making them ideal for math graduates seeking to pivot into business leadership roles without extensive time commitments.

Best Scientists Citing Jaroslav Nešetřil

Trending Scientists

Recently Published Articles