Peter Keevash

Q: What Schools Are Affiliated With Peter Keevash

Peter Keevash is affiliated with the following schools: University of Oxford, California Institute of Technology, Princeton University

Peter Keevash's AcademicInfluence.com Rankings

Peter Keevash

Mathematics

#2881

World Rank

#4359

Historical Rank

Combinatorics

#48

World Rank

#53

Historical Rank

Measure Theory

#3716

World Rank

#4382

Historical Rank

mathematics Degrees

Download Badge

Mathematics

Why Is Peter Keevash Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Peter Keevash is a British mathematician, working in combinatorics. He is a professor of mathematics at the University of Oxford and a Fellow of Mansfield College. Early years Keevash was born in Brighton, England, but mostly grew up in Leeds. He competed in the International Mathematical Olympiad in 1995. He entered Trinity College, University of Cambridge, in 1995 and completed his B.A. in mathematics in 1998. He earned his doctorate from Princeton University with Benny Sudakov as advisor. He took a postdoctoral position at the California Institute of Technology before moving to Queen Mary, University of London as a lecturer, and subsequently professor, before his move to Oxford in September 2013.

(See a Problem?)

Peter Keevash's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

The existence of designs (2014) (250)
The early evolution of the H-free process (2009) (168)
Surveys in Combinatorics 2011: Hypergraph Turán problems (2011) (150)
The Turán Number Of The Fano Plane (2005) (96)
A Geometric Theory for Hypergraph Matching (2011) (83)
The Number of Edge Colorings with no Monochromatic Cliques (2004) (79)
Shadows and intersections: Stability and new proofs (2008) (71)
Dynamic concentration of the triangle‐free process (2013) (70)
Loose Hamilton cycles in hypergraphs (2008) (68)
Rainbow Turán Problems (2006) (68)
Stability theorems for cancellative hypergraphs (2004) (68)
An exact minimum degree condition for Hamilton cycles in oriented graphs (2008) (64)
On A Hypergraph Turán Problem Of Frankl (2002) (61)
Set systems without a simplex or a cluster (2010) (57)
Algorithms for #BIS-hard problems on expander graphs (2018) (54)
Spectral Extremal Problems for Hypergraphs (2013) (51)
Equiangular lines and spherical codes in Euclidean space (2016) (49)
The existence of designs II (2018) (46)
A hypergraph Turán theorem via lagrangians of intersecting families (2013) (45)
Counting designs (2015) (44)
A multipartite Hajnal-Szemerédi theorem (2012) (38)
A hypergraph blow‐up lemma (2010) (37)
Turán numbers of bipartite graphs plus an odd cycle (2012) (31)
Triangle packings and 1-factors in oriented graphs (2008) (30)
ON A HYPERGRAPH TUR ´ AN PROBLEM OF FRANKL (2005) (29)
Set Systems with No Singleton Intersection (2006) (28)
Frankl-Rödl type theorems for codes and permutations (2014) (28)
Set Systems with Restricted Cross-Intersections and the Minimum Rank of Inclusion Matrices (2005) (27)
A hypergraph regularity method for generalized Turán problems (2008) (26)
A random construction for permutation codes and the covering radius (2006) (26)
Packing triangles in a graph and its complement (2004) (23)
Polynomial-time perfect matchings in dense hypergraphs (2013) (21)
Finding Hamilton cycles in robustly expanding digraphs (2012) (20)
New bounds for Ryser’s conjecture and related problems (2020) (20)
Pairwise intersections and forbidden configurations (2006) (20)
Multicolour Turán problems (2004) (19)
Necessary Conditions for the Global Rigidity of Direction–Length Frameworks (2011) (18)
A Semiexact Degree Condition for Hamilton Cycles in Digraphs (2010) (17)
Pancyclicity of Hamiltonian and highly connected graphs (2009) (17)
Hypercontractivity for global functions and sharp thresholds (2019) (16)
On a conjecture of Erdős and Simonovits: Even cycles (2011) (16)
Polynomial-time perfect matchings in dense hypergraphs☆ (2013) (16)
The characteristic polynomial of a random permutation matrix (2000) (15)
Disjoint representability of sets and their complements (2005) (14)
Rainbow factors in hypergraphs (2018) (13)
On the minimal degree implying equality of the largest triangle-free and bipartite subgraphs (2006) (12)
Digraph Girth via Chromatic Number (2013) (12)
Sparse halves in triangle-free graphs (2006) (12)
The Turán problem for projective geometries (2005) (12)
Codegree problems for projective geometries (2007) (12)
Stability for vertex isoperimetry in the cube (2018) (11)
Homomorphisms from the torus (2020) (11)
Local Density in Graphs with Forbidden Subgraphs (2003) (11)
The Turán Number of F3,3 (2011) (11)
Global hypercontractivity and its applications (2021) (11)
On the number of edges not covered by monochromatic copies of a fixed graph (2004) (10)
A stability result for the cube edge isoperimetric inequality (2017) (10)
Bounding the Number of Edges in Permutation Graphs (2006) (10)
Rainbow matchings in properly-coloured multigraphs (2017) (9)
Cycle-Complete Ramsey Numbers (2018) (9)
HYPERGRAPH MATCHINGS AND DESIGNS (2018) (9)
Directed Graphs Without Short Cycles (2008) (8)
On the Normalized Shannon Capacity of a Union (2016) (8)
The Turán Problem for Hypergraphs of Fixed Size (2005) (8)
On the number of symbols that forces a transversal (2018) (8)
Equiangular lines and spherical codes in Euclidean space (2017) (7)
Counting Steiner Triple Systems (2016) (7)
On a restricted cross-intersection problem (2006) (7)
Bounded Direction–Length Frameworks (2011) (6)
Coloured and Directed Designs (2018) (6)
Forbidden intersections for codes (2021) (6)
An Approximate Vertex-Isoperimetric Inequality for r-sets (2013) (6)
The generalised Oberwolfach problem (2020) (6)
Ringel's tree packing conjecture in quasirandom graphs (2020) (6)
An approximate isoperimetric inequality for r-sets (2012) (6)
The Turán number of $F_{3,3}$ (2011) (6)
Distinct degrees in induced subgraphs (2019) (5)
Forbidden vector‐valued intersections (2017) (5)
Finding Perfect Matchings in Dense Hypergraphs (2020) (5)
Multicoloured extremal problems (2004) (5)
A universal exponent for homeomorphs (2020) (4)
The Brown-Erdős-Sós conjecture for hypergraphs of large uniformity (2021) (4)
Bounds for spherical codes (2016) (3)
On the Largest Product-free Subsets of the Alternating Groups (2022) (3)
The Tur an problem for hypergraphs of xed size (2005) (3)
Addendum to Shadows and intersections: stability and new proofs (2010) (3)
Global rigidity of direction-length frameworks (2020) (2)
Isoperimetric stability in lattices (2020) (2)
The optimal edge-colouring threshold (2022) (2)
On a conjecture of Erdős and Simonovits: Even cycles (2013) (2)
A SEMIEXACT DEGREE CONDITION FOR HAMILTON CYCLES (2010) (1)
Locality in Sumsets (2023) (1)
The existence of subspace designs (2022) (1)
The Structure of Typical Eye-Free Graphs and a Turán-Type Result for Two Weighted Colours (2016) (1)
The sharp doubling threshold for approximate convexity (2023) (1)
Designs exist ! [ after (2015) (0)
Equiangular lines and subspaces in Euclidean spaces (2017) (0)
University of Birmingham Distinct degrees in induced subgraphs (2020) (0)
Rainbow Matchings in Properly Colored Multigraphs | SIAM Journal on Discrete Mathematics | Vol. 32, No. 3 | Society for Industrial and Applied Mathematics (2018) (0)
The characteristic polynomialof a random permutation matrixB (2000) (0)
The Brown-Erd\H{o}s-S\'os Conjecture for hypergraphs of large uniformity (2020) (0)
The $n$-queens problem (2021) (0)
C O ] 2 8 M ar 2 01 8 Rainbow factors in hypergraphs (2018) (0)
The extremal number of Venn diagrams (2019) (0)
The number of edge olorings with no mono hromati liquesNoga (2007) (0)
C O ] 3 O ct 2 01 9 Distinct degrees in induced subgraphs (2019) (0)
Finding matchings in dense hypergraphs (2022) (0)
A multipartite HajnalSzemerédi theorem (2015) (0)
Ju l 2 01 8 Stability for vertex isoperimetry in the cube (2018) (0)
Ju l 2 01 8 Cycle-complete Ramsey numbers (2018) (0)
Rigidity of Frameworks and Applications, 12th-15th July Abstracts of the Talks Ciprian Borcea Minimally rigid periodic graphs We prove a rigidity theorem of Maxwell-Laman type for periodic frameworks in arbitrary dimension. Bob Connelly t.b.a (2010) (0)

This paper list is powered by the following services:

Other Resources About Peter Keevash

en.wikipedia.org

What Schools Are Affiliated With Peter Keevash?

Peter Keevash is affiliated with the following schools:

Peter Keevash's Academic­Influence.com Rankings

Why Is Peter Keevash Influential?

Peter Keevash's Published Works

Published Works

Other Resources About Peter Keevash

What Schools Are Affiliated With Peter Keevash?

Peter Keevash's AcademicInfluence.com Rankings