2022 - Research.com Mathematics in Russia Leader Award
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 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.
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
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.
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.
Intersection theorems with geometric consequences
Peter Frankl;Richard M. Wilson.
Families of finite sets in which no set is covered by the union ofr others
P. Erdös;P. Frankl;Z. Füredi.
Israel Journal of Mathematics (1985)
Complexity classes in communication complexity theory
Laszlo Babai;Peter Frankl;Janos Simon.
foundations of computer science (1986)
The Johnson-Lindenstrauss lemma and the sphericity of some graphs
Peter Frankl;Hiroshi Maehara.
Journal of Combinatorial Theory, Series B (1988)
The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent
P. Erdös;P. Frankl;V. Rödl.
Graphs and Combinatorics (1986)
Some intersection theorems for ordered sets and graphs
F R Chung;R L Graham;P Frankl;J B Shearer.
Journal of Combinatorial Theory, Series A (1986)
On the maximum number of permutations with given maximal or minimal distance
Peter Frankl;Mikhail Deza.
Journal of Combinatorial Theory, Series A (1977)
An Extremal Problem for two Families of Sets
European Journal of Combinatorics (1982)
Extremal problems on set systems
Peter Frankl;Vojtech Rödl.
Random Structures and Algorithms (2002)
Erdös–Ko–Rado Theorem—22 Years Later
M. Deza;P. Frankl.
Siam Journal on Algebraic and Discrete Methods (1983)
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: