What is he best known for?
The fields of study he is best known for:
- Combinatorics
- Discrete mathematics
- Algebra
His primary scientific interests are in Combinatorics, Discrete mathematics, Upper and lower bounds, Finite set and Bipartite graph.
Daniel J. Kleitman studies Combinatorics, focusing on Degree in particular.
As part of his studies on Discrete mathematics, Daniel J. Kleitman frequently links adjacent subjects like Lattice.
He has included themes like Extreme point, Polyhedron, Quasi-polynomial and Linear inequality in his Upper and lower bounds study.
His Finite set research includes themes of Computer-assisted proof, Hereditarily finite set and Algebra.
Daniel J. Kleitman interconnects Base, Planarity testing and Loop in the investigation of issues within Algorithm.
His most cited work include:
- Algorithms for Loop Matchings (522 citations)
- Families of k-independent sets (220 citations)
- The structure of sperner k-families (190 citations)
What are the main themes of his work throughout his whole career to date?
Daniel J. Kleitman mainly focuses on Combinatorics, Discrete mathematics, Conjecture, Upper and lower bounds and Finite set.
His Combinatorics research is multidisciplinary, relying on both Family of sets, Plane and Order.
His studies link Intersection with Family of sets.
Daniel J. Kleitman frequently studies issues relating to General position and Plane.
His Discrete mathematics study incorporates themes from Algorithm, Lattice and Partition.
His Graph and Vertex and Multiple edges investigations all form part of his Graph research activities.
He most often published in these fields:
- Combinatorics (71.84%)
- Discrete mathematics (56.90%)
- Conjecture (9.20%)
What were the highlights of his more recent work (between 1993-2016)?
- Combinatorics (71.84%)
- Discrete mathematics (56.90%)
- Conjecture (9.20%)
In recent papers he was focusing on the following fields of study:
Daniel J. Kleitman spends much of his time researching Combinatorics, Discrete mathematics, Conjecture, Plane and Upper and lower bounds.
His work in the fields of Combinatorics, such as Chordal graph, Multiple edges and Complete graph, overlaps with other areas such as Aesthetic experience and Raising.
His Discrete mathematics research is multidisciplinary, incorporating elements of Intersection, Partition and Greedy algorithm.
The Conjecture study combines topics in areas such as Fractional part, Combinatorial proof, Constructive proof and Real number.
His work is dedicated to discovering how Plane, General position are connected with Spatial network, Disjoint sets, Forcing and Embedding and other disciplines.
The study incorporates disciplines such as Nested triangles graph, Shuffling, Permutation and Maximal independent set in addition to Upper and lower bounds.
Between 1993 and 2016, his most popular works were:
- MSARI: Multiple sequence alignments for statistical detection of RNA secondary structure (83 citations)
- Six Lonely Runners (34 citations)
- Convex Sets in the Plane with Three of Every Four Meeting (34 citations)
In his most recent research, the most cited papers focused on:
- Combinatorics
- Algebra
- Discrete mathematics
Daniel J. Kleitman mainly investigates Combinatorics, Discrete mathematics, Conjecture, Plane and General position.
Combinatorics is represented through his Partition and Rado graph research.
His work carried out in the field of Discrete mathematics brings together such families of science as Automated theorem proving and Greedy algorithm.
His Conjecture research incorporates elements of Fractional part, Combinatorial proof, Intersection and Real number.
His research in Plane intersects with topics in Without loss of generality, Intersection, Convex hull, Finite collection and Radon's theorem.
His research combines Upper and lower bounds and General position.
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.
