What is he best known for?
The fields of study he is best known for:
- Combinatorics
- Discrete mathematics
- Algebra
Jaroslav Nešetřil mostly deals with Combinatorics, Discrete mathematics, Bounded function, Homomorphism and Butterfly graph.
As part of his studies on Combinatorics, he frequently links adjacent subjects like Structure.
His study ties his expertise on Chromatic scale together with the subject of Discrete mathematics.
Jaroslav Nešetřil interconnects Nowhere dense set, Invariant, Dense graph, Partition and Bounded expansion in the investigation of issues within Bounded function.
His Homomorphism research is multidisciplinary, incorporating perspectives in Graph theory and Degree.
His Butterfly graph research is multidisciplinary, relying on both Friendship graph, Windmill graph and Null graph.
His most cited work include:
- Graphs and homomorphisms (638 citations)
- On the complexity of H -coloring (584 citations)
- Otakar Boruvka on minimum spanning tree problem translation of both the 1926 papers, comments, history (204 citations)
What are the main themes of his work throughout his whole career to date?
His main research concerns Combinatorics, Discrete mathematics, Homomorphism, Graph and Ramsey theory.
Jaroslav Nešetřil combines subjects such as Class and Bounded function with his study of Combinatorics.
The various areas that Jaroslav Nešetřil examines in his Bounded function study include Tree-depth and Degree.
His is doing research in Forbidden graph characterization, Ramsey's theorem, Line graph, 1-planar graph and Pathwidth, both of which are found in Discrete mathematics.
Jaroslav Nešetřil has researched Homomorphism in several fields, including Countable set, Order and Finite set.
His biological study spans a wide range of topics, including Graph theory and Conjecture.
He most often published in these fields:
- Combinatorics (78.68%)
- Discrete mathematics (65.07%)
- Homomorphism (20.59%)
What were the highlights of his more recent work (between 2010-2021)?
- Combinatorics (78.68%)
- Discrete mathematics (65.07%)
- Graph (14.34%)
In recent papers he was focusing on the following fields of study:
His primary areas of investigation include Combinatorics, Discrete mathematics, Graph, Homomorphism and Class.
His study in Combinatorics focuses on Dense graph, Ramsey's theorem, Ramsey theory, Conjecture and Automorphism.
His research integrates issues of Bounded function and Model theory in his study of Discrete mathematics.
His Multigraph and Connectivity study, which is part of a larger body of work in Graph, is frequently linked to First order and Algebraic closure, bridging the gap between disciplines.
His work deals with themes such as Fractal and Graph homomorphism, which intersect with Homomorphism.
His Class study combines topics from a wide range of disciplines, such as Property and Order.
Between 2010 and 2021, his most popular works were:
- On nowhere dense graphs (94 citations)
- Characterisations and examples of graph classes with bounded expansion (78 citations)
- When trees grow low: shrubs and fast MSO 1 (40 citations)
In his most recent research, the most cited papers focused on:
- Combinatorics
- Discrete mathematics
- Algebra
His primary scientific interests are in Combinatorics, Discrete mathematics, Graph, Dense graph and Bounded function.
His Combinatorics study often links to related topics such as Metric space.
His Discrete mathematics research includes elements of Chromatic scale and Nowhere dense set.
His work deals with themes such as First-order logic and Model theory, which intersect with Graph.
His biological study spans a wide range of topics, including Indifference graph and Modular decomposition.
His Bounded function research includes themes of Disjoint union, Characterization, Model checking, Graph property and Chordal graph.
This overview was generated by a machine learning system which analysed the scientist’s
body of work. If you have any feedback, you can
contact us
here.
