Peter Keevash

Publication Activity (10 Years)

Years Active: 2003-2024
Publications (10 Years): 20

Top Topics

Bipartite Graph

Euclidean Space

Top Venues

J. Comb. Theory, Ser. B

Comb. Probab. Comput.

J. Comb. Theory, Ser. A

Publications

Chung Shue Chen, Peter Keevash, Sean Kennedy, Élie de Panafieu, Adrian Vetta
Robot Positioning Using Torus Packing for Multisets. CoRR (2024)
Chung Shue Chen, Peter Keevash, Sean Kennedy, Élie de Panafieu, Adrian Vetta
Robot Positioning Using Torus Packing for Multisets. ICALP (2024)
Jie Han, Peter Keevash
Finding matchings in dense hypergraphs. CoRR (2022)
Peter Keevash, Katherine Staden
The generalised Oberwolfach problem. J. Comb. Theory, Ser. B 152 (2022)
Tom Bohman, Peter Keevash
Dynamic concentration of the triangle-free process. Random Struct. Algorithms 58 (2) (2021)
Matthew Jenssen, Peter Keevash, Will Perkins
Algorithms for #BIS-Hard Problems on Expander Graphs. SIAM J. Comput. 49 (4) (2020)
Peter Keevash, Eoin Long
Stability for vertex isoperimetry in the cube. J. Comb. Theory, Ser. B 145 (2020)
Peter Keevash, Liana Yepremyan
On the number of symbols that forces a transversal. Comb. Probab. Comput. 29 (2) (2020)
Katie Clinch, Bill Jackson, Peter Keevash
Global rigidity of direction-length frameworks. J. Comb. Theory, Ser. B 145 (2020)
Matthew Coulson, Peter Keevash, Guillem Perarnau, Liana Yepremyan
Rainbow factors in hypergraphs. J. Comb. Theory, Ser. A 172 (2020)
Jie Han, Peter Keevash
Finding Perfect Matchings in Dense Hypergraphs. SODA (2020)
Matthew Jenssen, Peter Keevash, Will Perkins
Algorithms for #BIS-hard problems on expander graphs. SODA (2019)
Peter Keevash, Eoin Long
A stability result for the cube edge isoperimetric inequality. J. Comb. Theory, Ser. A 155 (2018)
Peter Keevash, Liana Yepremyan
Rainbow Matchings in Properly Colored Multigraphs. SIAM J. Discret. Math. 32 (3) (2018)
Peter Keevash, Liana Yepremyan
On the number of symbols that forces a transversal. CoRR (2018)
Matthew Jenssen, Peter Keevash, Will Perkins
Algorithms for #BIS-hard problems on expander graphs. CoRR (2018)
Peter Keevash, Liana Yepremyan
Rainbow matchings in properly-coloured multigraphs. CoRR (2017)
Igor Balla, Felix Dräxler, Peter Keevash, Benny Sudakov
Equiangular lines and subspaces in Euclidean spaces. Electron. Notes Discret. Math. 61 (2017)
Peter Keevash, William Lochet
The Structure of Typical Eye-Free Graphs and a Turán-Type Result for Two Weighted Colours. Comb. Probab. Comput. 26 (6) (2017)
Peter Keevash, Eoin Long
On the Normalized Shannon Capacity of a Union. Comb. Probab. Comput. 25 (5) (2016)
Peter Keevash, Richard Mycroft
A multipartite Hajnal-Szemerédi theorem. J. Comb. Theory, Ser. B 114 (2015)
Peter Keevash, John Lenz, Dhruv Mubayi
Spectral Extremal Problems for Hypergraphs. SIAM J. Discret. Math. 28 (4) (2014)
Peter Keevash, Eoin Long
Frankl-Rödl type theorems for codes and permutations. CoRR (2014)
Peter Allen, Peter Keevash, Benny Sudakov, Jacques Verstraëte
Turán numbers of bipartite graphs plus an odd cycle. J. Comb. Theory, Ser. B 106 (2014)
Peter Keevash, Zhentao Li, Bojan Mohar, Bruce A. Reed
Digraph Girth via Chromatic Number. SIAM J. Discret. Math. 27 (2) (2013)
Dan Hefetz, Peter Keevash
A hypergraph Turán theorem via lagrangians of intersecting families. J. Comb. Theory, Ser. A 120 (8) (2013)
Peter Keevash, Benny Sudakov, Jacques Verstraëte
On a conjecture of Erdős and Simonovits: Even cycles. Comb. 33 (6) (2013)
Demetres Christofides, David Ellis, Peter Keevash
An Approximate Vertex-Isoperimetric Inequality for r-sets. Electron. J. Comb. 20 (4) (2013)
Peter Keevash, Fiachra Knox, Richard Mycroft
Polynomial-time perfect matchings in dense hypergraphs. STOC (2013)
Demetres Christofides, Peter Keevash, Daniela Kühn, Deryk Osthus
Finding Hamilton cycles in robustly expanding digraphs. J. Graph Algorithms Appl. 16 (2) (2012)
Peter Keevash, Dhruv Mubayi
. Comb. Probab. Comput. 21 (3) (2012)
Bill Jackson, Peter Keevash
Necessary Conditions for the Global Rigidity of Direction-Length Frameworks. Discret. Comput. Geom. 46 (1) (2011)
Bill Jackson, Peter Keevash
Bounded Direction-Length Frameworks. Discret. Comput. Geom. 46 (1) (2011)
Peter Keevash, Daniela Kühn, Richard Mycroft, Deryk Osthus
Loose Hamilton cycles in hypergraphs. Discret. Math. 311 (7) (2011)
Peter Keevash
A hypergraph blow-up lemma. Random Struct. Algorithms 39 (3) (2011)
Peter Keevash, Benny Sudakov
Pancyclicity of Hamiltonian and highly connected graphs. J. Comb. Theory, Ser. B 100 (5) (2010)
Jacob Fox, Peter Keevash, Benny Sudakov
Directed Graphs Without Short Cycles. Comb. Probab. Comput. 19 (2) (2010)
Peter Keevash, Dhruv Mubayi
Set systems without a simplex or a cluster. Comb. 30 (2) (2010)
Demetres Christofides, Peter Keevash, Daniela Kühn, Deryk Osthus
A Semiexact Degree Condition for Hamilton Cycles in Digraphs. SIAM J. Discret. Math. 24 (3) (2010)
Peter Keevash, Benny Sudakov
Triangle packings and 1-factors in oriented graphs. J. Comb. Theory, Ser. B 99 (4) (2009)
Peter Keevash
A hypergraph regularity method for generalized Turán problems. Random Struct. Algorithms 34 (1) (2009)
Peter Keevash, Yi Zhao
Codegree problems for projective geometries. J. Comb. Theory, Ser. B 97 (6) (2007)
Peter Keevash, Dhruv Mubayi, Benny Sudakov, Jacques Verstraëte
Rainbow Turán Problems. Comb. Probab. Comput. 16 (1) (2007)
Peter Keevash, Benny Sudakov
Sparse halves in triangle-free graphs. J. Comb. Theory, Ser. B 96 (4) (2006)
Peter Keevash, Po-Shen Loh, Benny Sudakov
Bounding the Number of Edges in Permutation Graphs. Electron. J. Comb. 13 (1) (2006)
József Balogh, Peter Keevash, Benny Sudakov
On the minimal degree implying equality of the largest triangle-free and bipartite subgraphs. J. Comb. Theory, Ser. B 96 (6) (2006)
Peter Keevash, Cheng Yeaw Ku
A random construction for permutation codes and the covering radius. Des. Codes Cryptogr. 41 (1) (2006)
Peter Keevash, Benny Sudakov
On a restricted cross-intersection problem. J. Comb. Theory, Ser. A 113 (7) (2006)
Richard P. Anstee, Peter Keevash
Pairwise intersections and forbidden configurations. Eur. J. Comb. 27 (8) (2006)
Peter Keevash, Dhruv Mubayi, Richard M. Wilson
Set Systems with No Singleton Intersection. SIAM J. Discret. Math. 20 (4) (2006)
József Balogh, Peter Keevash, Benny Sudakov
Disjoint representability of sets and their complements. J. Comb. Theory, Ser. B 95 (1) (2005)
Peter Keevash
The Turán Problem for Hypergraphs of Fixed Size. Electron. J. Comb. 12 (2005)
Peter Keevash, Benny Sudakov
Set Systems with Restricted Cross-Intersections and the Minimum Rank of Inclusion Matrices. SIAM J. Discret. Math. 18 (4) (2005)
Peter Keevash
The Turán problem for projective geometries. J. Comb. Theory, Ser. A 111 (2) (2005)
Peter Keevash, Benny Sudakov
On A Hypergraph Turán Problem Of Frankl. Comb. 25 (6) (2005)
Peter Keevash, Benny Sudakov
The Turán Number Of The Fano Plane. Comb. 25 (5) (2005)
Peter Keevash, Mike Saks, Benny Sudakov, Jacques Verstraëte
Multicolour Turán problems. Adv. Appl. Math. 33 (2) (2004)
Peter Keevash, Benny Sudakov
On the number of edges not covered by monochromatic copies of a fixed graph. J. Comb. Theory, Ser. B 90 (1) (2004)
Béla Bollobás, Peter Keevash, Benny Sudakov
Multicoloured extremal problems. J. Comb. Theory, Ser. A 107 (2) (2004)
Peter Keevash, Benny Sudakov
Packing triangles in a graph and its complement. J. Graph Theory 47 (3) (2004)
Peter Keevash, Dhruv Mubayi
Stability theorems for cancellative hypergraphs. J. Comb. Theory, Ser. B 92 (1) (2004)
Peter Keevash, Benny Sudakov
Local Density In Graphs With Forbidden Subgraphs. Comb. Probab. Comput. 12 (2) (2003)