What is he best known for?
The fields of study he is best known for:
- Combinatorics
- Geometry
- Discrete mathematics
His main research concerns Combinatorics, Discrete mathematics, Upper and lower bounds, Graph and Algorithm.
Gábor Tardos performs multidisciplinary study on Combinatorics and Formal power series in his works.
As part of his studies on Discrete mathematics, he often connects relevant subjects like Block matrix.
His study explores the link between Graph and topics such as Absolute constant that cross with problems in Multiplicative constant, Vertex partition, Degree and Bounded function.
His work on Standard model as part of general Algorithm study is frequently linked to High rate, Weak model and Fountain code, therefore connecting diverse disciplines of science.
His study in the field of Luby transform code is also linked to topics like Fingerprint and Traitor tracing.
His most cited work include:
- A constructive proof of the general lovász local lemma (391 citations)
- Excluded permutation matrices and the Stanley-Wilf conjecture (379 citations)
- On the power of randomization in on-line algorithms (227 citations)
What are the main themes of his work throughout his whole career to date?
The scientist’s investigation covers issues in Combinatorics, Discrete mathematics, Upper and lower bounds, Conjecture and Graph.
His Combinatorics study integrates concerns from other disciplines, such as Point, Plane and Bounded function.
His Discrete mathematics research includes themes of Degree and Constant.
The study incorporates disciplines such as Algorithm and Communication complexity in addition to Upper and lower bounds.
His Conjecture study combines topics from a wide range of disciplines, such as Intersection, Sequence and Regular polygon.
His biological study spans a wide range of topics, including Chromatic scale and Topology.
He most often published in these fields:
- Combinatorics (90.00%)
- Discrete mathematics (43.50%)
- Upper and lower bounds (18.50%)
What were the highlights of his more recent work (between 2016-2020)?
- Combinatorics (90.00%)
- Conjecture (15.50%)
- Plane (13.50%)
In recent papers he was focusing on the following fields of study:
Combinatorics, Conjecture, Plane, Upper and lower bounds and Vertex are his primary areas of study.
Borrowing concepts from Omega, he weaves in ideas under Combinatorics.
His study looks at the relationship between Conjecture and topics such as Intersection, which overlap with Lemma, Clique, Transversal, Approximation algorithm and Time complexity.
He has researched Plane in several fields, including Point, Pairwise comparison, Perimeter and Constant.
Gábor Tardos combines subjects such as Multigraph and Ordered graph with his study of Upper and lower bounds.
Gábor Tardos focuses mostly in the field of Vertex, narrowing it down to topics relating to Disjoint sets and, in certain cases, Clique number and Arbitrarily large.
Between 2016 and 2020, his most popular works were:
- On max-clique for intersection graphs of sets and the hadwiger-debrunner numbers (10 citations)
- On the Turán number of ordered forests (8 citations)
- Tilings with noncongruent triangles (6 citations)
In his most recent research, the most cited papers focused on:
- Combinatorics
- Geometry
- Algorithm
His scientific interests lie mostly in Combinatorics, Plane, Conjecture, Discrete mathematics and Perimeter.
Gábor Tardos studies Vertex, a branch of Combinatorics.
His studies deal with areas such as Quadratic equation, Approximation algorithm, Regular polygon, Transversal and Clique as well as Conjecture.
His Discrete mathematics study frequently draws connections to other fields, such as Duality.
The concepts of his Perimeter study are interwoven with issues in Convex polygon and Pairwise comparison.
The Upper and lower bounds study which covers Ordered graph that intersects with Bound 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.
