What is he best known for?
The fields of study he is best known for:
- Combinatorics
- Discrete mathematics
- Algebra
Peter Frankl focuses on Combinatorics, Discrete mathematics, Conjecture, Hypergraph and Finite set.
His study in Combinatorics is interdisciplinary in nature, drawing from both Vector space and Cardinality.
He interconnects Generalization and Constant in the investigation of issues within Discrete mathematics.
Peter Frankl usually deals with Conjecture and limits it to topics linked to Matching and Perfect power and Degree.
The Hypergraph study combines topics in areas such as Jump and Negative - answer.
His study looks at the intersection of Finite set and topics like Steiner system with Algebra over a field, Combinatorial group testing and Disjoint sets.
His most cited work include:
- Intersection theorems with geometric consequences (439 citations)
- Families of finite sets in which no set is covered by the union ofr others (381 citations)
- Complexity classes in communication complexity theory (285 citations)
What are the main themes of his work throughout his whole career to date?
His main research concerns Combinatorics, Discrete mathematics, Conjecture, Intersection and Finite set.
His biological study spans a wide range of topics, including Family of sets, Element and Matching.
His research in Discrete mathematics intersects with topics in Cardinality and Type.
His study brings together the fields of Partition and Disjoint sets.
Hypergraph connects with themes related to Upper and lower bounds in his study.
He most often published in these fields:
- Combinatorics (92.13%)
- Discrete mathematics (54.75%)
- Conjecture (15.74%)
What were the highlights of his more recent work (between 2016-2021)?
- Combinatorics (92.13%)
- Disjoint sets (12.79%)
- Conjecture (15.74%)
In recent papers he was focusing on the following fields of study:
His primary areas of investigation include Combinatorics, Disjoint sets, Conjecture, Family of sets and Discrete mathematics.
The various areas that Peter Frankl examines in his Combinatorics study include Matching and Element.
His study on Disjoint sets also encompasses disciplines like
- Partition that intertwine with fields like Ordered pair,
- Set theory that intertwine with fields like Resolution.
Peter Frankl has researched Conjecture in several fields, including Mathematical proof and Integer.
His research on Discrete mathematics focuses in particular on Erdős–Ko–Rado theorem.
His research investigates the link between Hypergraph and topics such as Upper and lower bounds that cross with problems in Extremal combinatorics.
Between 2016 and 2021, his most popular works were:
- On the maximum number of edges in a hypergraph with given matching number (47 citations)
- Extremal Problems for Finite Sets (35 citations)
- Erdős–Ko–Rado theorem for {0,±1}-vectors (20 citations)
In his most recent research, the most cited papers focused on:
- Combinatorics
- Algebra
- Real number
Peter Frankl spends much of his time researching Combinatorics, Disjoint sets, Family of sets, Conjecture and Maximum size.
His study in Combinatorics is interdisciplinary in nature, drawing from both Matching, Element, Mathematical proof and Discrete mathematics.
His Hypergraph and Beal's conjecture study in the realm of Discrete mathematics interacts with subjects such as Erdős–Straus conjecture, Erdős–Gyárfás conjecture and Range.
His studies deal with areas such as Function, State, Bounded function and Set theory as well as Family of sets.
His Conjecture study incorporates themes from Measure, Product measure and Discrete geometry.
His work in Erdős–Ko–Rado theorem covers topics such as Vertex which are related to areas like Common element and Degree.
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.
