1973 - Fellow of the American Academy of Arts and Sciences
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.
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.
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.
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.
Algorithms for Loop Matchings
Ruth Nussinov;George Pieczenik;Jerrold R. Griggs;Daniel J. Kleitman.
Siam Journal on Applied Mathematics (1978)
Families of k-independent sets
Daniel J. Kleitman;Joel Spencer.
Discrete Mathematics (1973)
Proof techniques in the theory of finite sets
Curtis Greene;Daniel J. Kleitman.
The structure of sperner k-families
Curtis Greene;Daniel J Kleitman.
Journal of Combinatorial Theory, Series A (1976)
Asymptotic enumeration of partial orders on a finite set
D. J. Kleitman;B. L. Rothschild.
Transactions of the American Mathematical Society (1975)
Traditional Galleries Require Fewer Watchmen
J. Kahn;M. Klawe;D. Kleitman.
Siam Journal on Algebraic and Discrete Methods (1983)
Spanning trees with many leaves
Daniel J. Kleitman;Douglas B. West.
SIAM Journal on Discrete Mathematics (1991)
Coping with errors in binary search procedures
Ronald L. Rivest;Albert R. Meyer;Daniel J. Kleitman;Karl Winklmann.
Journal of Computer and System Sciences (1980)
Algorithms for constructing graphs and digraphs with given valences and factors
D. J. Kleitman;D. L. Wang.
Discrete Mathematics (1973)
The crossing number of K5,n
Daniel J. Kleitman;Daniel J. Kleitman.
Journal of Combinatorial Theory, Series A (1970)
If you think any of the details on this page are incorrect, let us know.
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: