- Home
- Best Scientists - Mathematics
- Jacob Fox

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

Computer Science
D-index
33
Citations
3,551
154
World Ranking
6859
National Ranking
3294

Mathematics
D-index
33
Citations
3,648
161
World Ranking
1720
National Ranking
719

2013 - Fellow of Alfred P. Sloan Foundation

- Combinatorics
- Discrete mathematics
- Algebra

Jacob Fox spends much of his time researching Combinatorics, Discrete mathematics, Ramsey's theorem, Graph power and Graph minor. His work carried out in the field of Combinatorics brings together such families of science as Upper and lower bounds and Constant. His Discrete mathematics research focuses on Partition and how it connects with Céa's lemma and Estimation lemma.

The various areas that he examines in his Ramsey's theorem study include Ramsey theory, Mathematical proof and Degree. His studies in Graph minor integrate themes in fields like Distance-regular graph, Universal graph and Bound graph. His Lemma research includes elements of Graph theory, Algorithmics, Symbolic computation and Graph.

- A new proof of the graph removal lemma (139 citations)
- Density theorems for bipartite graphs and related Ramsey-type results (103 citations)
- Hypergraph Ramsey numbers (100 citations)

His main research concerns Combinatorics, Discrete mathematics, Graph, Upper and lower bounds and Conjecture. His Combinatorics and Ramsey's theorem, Lemma, Complete graph, Bipartite graph and Hypergraph investigations all form part of his Combinatorics research activities. Jacob Fox has researched Ramsey's theorem in several fields, including Ramsey theory and Bounded function.

His Graph research integrates issues from Absolute constant and Constant factor. His Upper and lower bounds research incorporates themes from Binary logarithm, Permutation and Constant. Jacob Fox interconnects Vertex, Clique, Integer and Random graph in the investigation of issues within Conjecture.

- Combinatorics (93.70%)
- Discrete mathematics (40.74%)
- Graph (26.67%)

- Combinatorics (93.70%)
- Graph (26.67%)
- Conjecture (22.22%)

His primary areas of investigation include Combinatorics, Graph, Conjecture, Upper and lower bounds and Ramsey's theorem. The concepts of his Combinatorics study are interwoven with issues in Bounded function and Polynomial. His Graph research incorporates elements of Connected component and Finite field.

The Conjecture study combines topics in areas such as Constant, Existential quantification, Function, Graph coloring and Bipartite graph. His Upper and lower bounds research focuses on Term and how it relates to Binary logarithm. His work deals with themes such as Ramsey theory, Independence number, Edge and Open problem, which intersect with Ramsey's theorem.

- Erdős-Ginzburg-Ziv Constants by Avoiding Three-Term Arithmetic Progressions (12 citations)
- Erdős–Hajnal Conjecture for Graphs with Bounded VC-Dimension (10 citations)
- Online Ramsey Numbers and the Subgraph Query Problem (10 citations)

- Combinatorics
- Algebra
- Discrete mathematics

The scientist’s investigation covers issues in Combinatorics, Graph, Conjecture, Upper and lower bounds and Lemma. His study in Bounded function extends to Combinatorics with its themes. His work in the fields of Graph, such as Vertex, Ramsey's theorem, Dense graph and Vertex deletion, intersects with other areas such as Distribution free.

His studies deal with areas such as Vertex, Binary logarithm, Log-log plot, Connectivity and Graph coloring as well as Conjecture. Jacob Fox has included themes like Connection, Prime, Time complexity, Arboricity and Connected component in his Upper and lower bounds study. His study in Lemma is interdisciplinary in nature, drawing from both Property testing, If and only if, Tournament, Digraph and Abelian group.

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.

A new proof of the graph removal lemma

Jacob Fox.

Annals of Mathematics **(2011)**

139 Citations

Density theorems for bipartite graphs and related Ramsey-type results

Jacob Fox;Benny Sudakov.

Combinatorica **(2009)**

103 Citations

Hypergraph Ramsey numbers

David Conlon;Jacob Fox;Benny Sudakov.

Journal of the American Mathematical Society **(2010)**

100 Citations

THE NUMBER OF EDGES IN k-QUASI-PLANAR GRAPHS

Jacob Fox;János Pach;Andrew Suk.

SIAM Journal on Discrete Mathematics **(2013)**

96 Citations

Induced Ramsey-type theorems

Jacob Fox;Benny Sudakov.

Advances in Mathematics **(2008)**

93 Citations

Bounds for graph regularity and removal lemmas

David Conlon;Jacob Fox.

Geometric and Functional Analysis **(2012)**

93 Citations

Overlap properties of geometric expanders

Jacob Fox;Mikhail Gromov;Vincent Lafforgue;Assaf Naor.

symposium on discrete algorithms **(2012)**

91 Citations

Dependent random choice

Jacob Fox;Benny Sudakov.

Random Structures and Algorithms **(2011)**

86 Citations

Stanley-Wilf limits are typically exponential

Jacob Fox.

arXiv: Combinatorics **(2013)**

84 Citations

AN APPROXIMATE VERSION OF SIDORENKO'S CONJECTURE

David Conlon;Jacob Fox;Benny Sudakov.

Geometric and Functional Analysis **(2010)**

81 Citations

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

Contact us

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:

ETH Zurich

Alfréd Rényi Institute of Mathematics

Eötvös Loránd University

Princeton University

Princeton University

Tel Aviv University

University of California, Santa Cruz

Columbia University

Princeton University

Emory University

Something went wrong. Please try again later.