D-Index & Metrics Best Publications

D-Index & Metrics

Discipline name D-index D-index (Discipline H-index) only includes papers and citation values for an examined discipline in contrast to General H-index which accounts for publications across all disciplines. Citations Publications World Ranking National Ranking
Mathematics D-index 33 Citations 6,520 79 World Ranking 1732 National Ranking 9
Engineering and Technology D-index 33 Citations 6,422 76 World Ranking 4481 National Ranking 6

Overview

What is he best known for?

The fields of study he is best known for:

  • Combinatorics
  • Discrete mathematics
  • Geometry

Miklós Simonovits mostly deals with Combinatorics, Discrete mathematics, Graph, Lemma and Complement graph. While working in this field, Miklós Simonovits studies both Combinatorics and Random walk. Many of his research projects under Discrete mathematics are closely connected to Time reversibility with Time reversibility, tying the diverse disciplines of science together.

His study in the fields of Multiple edges and Vertex under the domain of Graph overlaps with other disciplines such as Stability theorem and Speed function. His Complement graph study integrates concerns from other disciplines, such as Friendship graph, Quartic graph, Erdős–Stone theorem and Strength of a graph. His work on Turán number as part of general Conjecture study is frequently linked to Measure, therefore connecting diverse disciplines of science.

His most cited work include:

  • Szemeredi''s Regularity Lemma and its applications in graph theory (451 citations)
  • Random walks in a convex body and an improved volume algorithm (360 citations)
  • Isoperimetric problems for convex bodies and a localization lemma (347 citations)

What are the main themes of his work throughout his whole career to date?

Miklós Simonovits mainly focuses on Combinatorics, Discrete mathematics, Graph, Extremal graph theory and Conjecture. His Combinatorics study is mostly concerned with Hypergraph, Graph power, Ramsey's theorem, Lemma and Cubic graph. The Ramsey's theorem study combines topics in areas such as Ramsey theory and Complete graph.

His study in Line graph, Random graph, Forbidden graph characterization, Bipartite graph and Universal graph falls under the purview of Discrete mathematics. His biological study spans a wide range of topics, including Number theory, Friendship graph, Graph theory and Field. Miklós Simonovits combines subjects such as Embedding and Existential quantification with his study of Conjecture.

He most often published in these fields:

  • Combinatorics (95.56%)
  • Discrete mathematics (68.89%)
  • Graph (23.33%)

What were the highlights of his more recent work (between 2013-2019)?

  • Combinatorics (95.56%)
  • Discrete mathematics (68.89%)
  • Graph (23.33%)

In recent papers he was focusing on the following fields of study:

Miklós Simonovits focuses on Combinatorics, Discrete mathematics, Graph, Embedding and Extremal graph theory. His research ties Tree embedding and Combinatorics together. Miklós Simonovits mostly deals with Vertex in his studies of Discrete mathematics.

In the field of Graph, his study on Independence number overlaps with subjects such as Random choice and Phase transition. His Embedding study combines topics from a wide range of disciplines, such as Lemma and Field. In his research, Forbidden graph characterization and Block graph is intimately related to Book embedding, which falls under the overarching field of Factor-critical graph.

Between 2013 and 2019, his most popular works were:

  • The Approximate Loebl--Komlós--Sós Conjecture III: The Finer Structure of LKS Graphs (21 citations)
  • The Approximate Loebl--Komlós--Sós Conjecture IV: Embedding Techniques and the Proof of the Main Result (20 citations)
  • The approximate Loebl-Koml'os-S'os Conjecture I: The sparse decomposition (17 citations)

In his most recent research, the most cited papers focused on:

  • Combinatorics
  • Geometry
  • Algebra

Miklós Simonovits mostly deals with Discrete mathematics, Combinatorics, Extremal graph theory, Graph and Tree embedding. His work in Regular graph, Existential quantification, Book embedding and Complement graph is related to Combinatorics. Regular graph connects with themes related to Cubic graph in his study.

His Book embedding research incorporates themes from Forbidden graph characterization, Distance-hereditary graph, Block graph, Universal graph and Factor-critical graph. The study incorporates disciplines such as Tree decomposition, Modular decomposition, Path graph and Graph factorization in addition to Complement graph. His studies deal with areas such as Embedding, Dense graph and Conjecture as well as Extremal graph theory.

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.

Best Publications

Szemeredi''s Regularity Lemma and its applications in graph theory

Janos Komlos;Miklos Simonovits.
(1995)

691 Citations

Random walks in a convex body and an improved volume algorithm

László Lovász;Miklós Simonovits.
Random Structures and Algorithms (1993)

518 Citations

Cycles of even length in graphs

J.A Bondy;M Simonovits.
Journal of Combinatorial Theory, Series B (1974)

505 Citations

Isoperimetric problems for convex bodies and a localization lemma

R. Kannan;L. Lovász;M. Simonovits.
Discrete and Computational Geometry (1995)

379 Citations

Random walks and an O * ( n 5 ) volume algorithm for convex bodies

Ravi Kannan;László Lovász;Miklós Simonovits.
Random Structures and Algorithms (1997)

357 Citations

SUPERSATURATED GRAPHS AND HYPERGRAPHS

Paul Erdos;Miklós Simonovits.
Combinatorica (1983)

350 Citations

The mixing rate of Markov chains, an isoperimetric inequality, and computing the volume

Laszlo Lovasz;Miklos Simonovits.
foundations of computer science (1990)

260 Citations

The History of Degenerate (Bipartite) Extremal Graph Problems

Zoltán Füredi;Miklós Simonovits.
arXiv: Combinatorics (2013)

260 Citations

The Regularity Lemma and Its Applications in Graph Theory

János Komlós;Ali Shokoufandeh;Miklós Simonovits;Endre Szemerédi.
Lecture Notes in Computer Science (2002)

172 Citations

On the number of complete subgraphs of a graph II

L. Lovász;M. Simonovits.
(1983)

171 Citations

Best Scientists Citing Miklós Simonovits

Benny Sudakov

Benny Sudakov

ETH Zurich

Publications: 74

József Balogh

József Balogh

University of Illinois at Urbana-Champaign

Publications: 71

Noga Alon

Noga Alon

Tel Aviv University

Publications: 65

Santosh Vempala

Santosh Vempala

Georgia Institute of Technology

Publications: 62

Zoltán Füredi

Zoltán Füredi

University of Illinois at Urbana-Champaign

Publications: 38

Yoshiharu Kohayakawa

Yoshiharu Kohayakawa

Universidade de São Paulo

Publications: 34

László Lovász

László Lovász

Eötvös Loránd University

Publications: 32

Vojtěch Rödl

Vojtěch Rödl

Emory University

Publications: 31

Raphael Yuster

Raphael Yuster

University of Haifa

Publications: 30

Jacob Fox

Jacob Fox

Stanford University

Publications: 30

Deryk Osthus

Deryk Osthus

University of Birmingham

Publications: 29

Michael Krivelevich

Michael Krivelevich

Tel Aviv University

Publications: 28

Daniela Kühn

Daniela Kühn

University of Birmingham

Publications: 27

Fan Chung

Fan Chung

University of California, San Diego

Publications: 26

Alan Frieze

Alan Frieze

Carnegie Mellon University

Publications: 25

Endre Szemerédi

Endre Szemerédi

Alfréd Rényi Institute of Mathematics

Publications: 24

Profile was last updated on December 6th, 2021.
Research.com Ranking is based on data retrieved from the Microsoft Academic Graph (MAG).
The ranking d-index is inferred from publications deemed to belong to the considered discipline.

If you think any of the details on this page are incorrect, let us know.

Contact us
Something went wrong. Please try again later.