What is he best known for?
The fields of study he is best known for:
- Combinatorics
- Geometry
- Discrete mathematics
Vašek Chvátal focuses on Combinatorics, Discrete mathematics, Travelling salesman problem, Indifference graph and Cograph.
His work on Combinatorics is being expanded to include thematically relevant topics such as Upper and lower bounds.
Much of his study explores Discrete mathematics relationship to Integer programming.
In general Travelling salesman problem, his work in Bottleneck traveling salesman problem is often linked to Preliminary report and Range linking many areas of study.
His Indifference graph research is multidisciplinary, relying on both Modular decomposition and Chordal graph.
His work carried out in the field of Cograph brings together such families of science as Trivially perfect graph, Strong perfect graph theorem, Split graph, Perfect graph theorem and Perfect graph.
His most cited work include:
- A Greedy Heuristic for the Set-Covering Problem (2158 citations)
- The Traveling Salesman Problem: A Computational Study (1212 citations)
- On certain polytopes associated with graphs (513 citations)
What are the main themes of his work throughout his whole career to date?
His primary scientific interests are in Combinatorics, Discrete mathematics, Graph, Perfect graph and Metric space.
Perfect graph theorem, Chordal graph, Conjecture, De Bruijn sequence and Line graph are the primary areas of interest in his Combinatorics study.
The Chordal graph study which covers Indifference graph that intersects with Split graph.
His work is connected to Distance-hereditary graph, Cograph, Graph power, Factor-critical graph and Complement graph, as a part of Discrete mathematics.
Vašek Chvátal works mostly in the field of Cograph, limiting it down to topics relating to Strong perfect graph theorem and, in certain cases, Modular decomposition, as a part of the same area of interest.
In general Metric space study, his work on De Bruijn–Erdős theorem and Injective metric space often relates to the realm of Generalization, thereby connecting several areas of interest.
He most often published in these fields:
- Combinatorics (78.38%)
- Discrete mathematics (54.05%)
- Graph (10.81%)
What were the highlights of his more recent work (between 2008-2021)?
- Combinatorics (78.38%)
- Discrete mathematics (54.05%)
- Metric space (8.11%)
In recent papers he was focusing on the following fields of study:
His scientific interests lie mostly in Combinatorics, Discrete mathematics, Metric space, De Bruijn sequence and De Bruijn–Erdős theorem.
His study in the field of Chordal graph is also linked to topics like Betweenness centrality.
His Discrete mathematics research incorporates elements of Tree and Conditional independence.
His De Bruijn sequence study deals with Injective metric space intersecting with Uniform continuity and Convex metric space.
While the research belongs to areas of De Bruijn–Erdős theorem, Vašek Chvátal spends his time largely on the problem of Extremal combinatorics, intersecting his research to questions surrounding Upper and lower bounds and Discrete geometry.
His Eigenvalues and eigenvectors study combines topics from a wide range of disciplines, such as Random regular graph, Two-graph and Indifference graph.
Between 2008 and 2021, his most popular works were:
- Certification of an optimal TSP tour through 85,900 cities (77 citations)
- A de Bruijn - Erdos theorem and metric spaces (19 citations)
- Antimatroids, Betweenness, Convexity (18 citations)
In his most recent research, the most cited papers focused on:
- Combinatorics
- Geometry
- Discrete mathematics
His main research concerns Combinatorics, Discrete mathematics, De Bruijn–Erdős theorem, Metric space and Convexity.
His research in Discrete mathematics is mostly focused on Hypergraph.
Vašek Chvátal combines subjects such as Extremal combinatorics and Convex metric space with his study of De Bruijn–Erdős theorem.
He interconnects Plane and De Bruijn sequence in the investigation of issues within Metric space.
His De Bruijn sequence research incorporates themes from Intrinsic metric, Injective metric space and Uniform continuity.
His Line research integrates issues from Carry, Vertex and Upper and lower bounds.
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.
