Peter Keevash

According to our database, Peter Keevash authored at least 59 papers between 2003 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2024

Sharp bounds for a discrete John's theorem.

Peter van Hintum, Peter Keevash

Comb. Probab. Comput., 2024

Robot Positioning Using Torus Packing for Multisets.

Chung Shue Chen, Peter Keevash, Sean Kennedy, Élie de Panafieu, Adrian Vetta

Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 2024

2022

The generalised Oberwolfach problem.

Peter Keevash, Katherine Staden

J. Comb. Theory B, 2022

Finding matchings in dense hypergraphs.

Jie Han, Peter Keevash

CoRR, 2022

2021

Dynamic concentration of the triangle-free process.

Tom Bohman, Peter Keevash

Random Struct. Algorithms, 2021

2020

Algorithms for #BIS-Hard Problems on Expander Graphs.

Matthew Jenssen, Peter Keevash, Will Perkins

SIAM J. Comput., 2020

Stability for vertex isoperimetry in the cube.

Peter Keevash, Eoin Long

J. Comb. Theory B, 2020

Global rigidity of direction-length frameworks.

Katie Clinch, Bill Jackson, Peter Keevash

J. Comb. Theory B, 2020

Rainbow factors in hypergraphs.

Matthew Coulson, Peter Keevash, Guillem Perarnau, Liana Yepremyan

J. Comb. Theory A, 2020

On the number of symbols that forces a transversal.

Peter Keevash, Liana Yepremyan

Comb. Probab. Comput., 2020

Finding Perfect Matchings in Dense Hypergraphs.

Jie Han, Peter Keevash

Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

2018

Rainbow Matchings in Properly Colored Multigraphs.

Peter Keevash, Liana Yepremyan

SIAM J. Discret. Math., 2018

A stability result for the cube edge isoperimetric inequality.

Peter Keevash, Eoin Long

J. Comb. Theory A, 2018

2017

Equiangular lines and subspaces in Euclidean spaces.

Igor Balla, Felix Dräxler, Peter Keevash, Benny Sudakov

Electron. Notes Discret. Math., 2017

The Structure of Typical Eye-Free Graphs and a Turán-Type Result for Two Weighted Colours.

Peter Keevash, William Lochet

Comb. Probab. Comput., 2017

Rainbow matchings in properly-coloured multigraphs.

Peter Keevash, Liana Yepremyan

CoRR, 2017

2016

On the Normalized Shannon Capacity of a Union.

Peter Keevash, Eoin Long

Comb. Probab. Comput., 2016

2015

A multipartite Hajnal-Szemerédi theorem.

Peter Keevash, Richard Mycroft

J. Comb. Theory B, 2015

2014

Spectral Extremal Problems for Hypergraphs.

Peter Keevash, John Lenz, Dhruv Mubayi

SIAM J. Discret. Math., 2014

Turán numbers of bipartite graphs plus an odd cycle.

Peter Allen, Peter Keevash, Benny Sudakov, Jacques Verstraëte

J. Comb. Theory B, 2014

Frankl-Rödl type theorems for codes and permutations.

Peter Keevash, Eoin Long

CoRR, 2014

2013

Digraph Girth via Chromatic Number.

Peter Keevash, Zhentao Li, Bojan Mohar, Bruce A. Reed

SIAM J. Discret. Math., 2013

A hypergraph Turán theorem via lagrangians of intersecting families.

Dan Hefetz, Peter Keevash

J. Comb. Theory A, 2013

An Approximate Vertex-Isoperimetric Inequality for r-sets.

Demetres Christofides, David Ellis, Peter Keevash

Electron. J. Comb., 2013

On a conjecture of Erdős and Simonovits: Even cycles.

Peter Keevash, Benny Sudakov, Jacques Verstraëte

Comb., 2013

Polynomial-time perfect matchings in dense hypergraphs.

Peter Keevash, Fiachra Knox, Richard Mycroft

Proceedings of the Symposium on Theory of Computing Conference, 2013

2012

Finding Hamilton cycles in robustly expanding digraphs.

Demetres Christofides, Peter Keevash, Daniela Kühn, Deryk Osthus

J. Graph Algorithms Appl., 2012

The Turán Number of <i>F</i>_{3, 3}.

Peter Keevash, Dhruv Mubayi

Comb. Probab. Comput., 2012

2011

A hypergraph blow-up lemma.

Peter Keevash

Random Struct. Algorithms, 2011

Loose Hamilton cycles in hypergraphs.

Peter Keevash, Daniela Kühn, Richard Mycroft, Deryk Osthus

Discret. Math., 2011

Necessary Conditions for the Global Rigidity of Direction-Length Frameworks.

Bill Jackson, Peter Keevash

Discret. Comput. Geom., 2011

Bounded Direction-Length Frameworks.

Bill Jackson, Peter Keevash

Discret. Comput. Geom., 2011

2010

A Semiexact Degree Condition for Hamilton Cycles in Digraphs.

Demetres Christofides, Peter Keevash, Daniela Kühn, Deryk Osthus

SIAM J. Discret. Math., 2010

Pancyclicity of Hamiltonian and highly connected graphs.

Peter Keevash, Benny Sudakov

J. Comb. Theory B, 2010

Directed Graphs Without Short Cycles.

Jacob Fox, Peter Keevash, Benny Sudakov

Comb. Probab. Comput., 2010

Set systems without a simplex or a cluster.

Peter Keevash, Dhruv Mubayi

Comb., 2010

2009

A hypergraph regularity method for generalized Turán problems.

Peter Keevash

Random Struct. Algorithms, 2009

Triangle packings and 1-factors in oriented graphs.

Peter Keevash, Benny Sudakov

J. Comb. Theory B, 2009

2007

Codegree problems for projective geometries.

Peter Keevash, Yi Zhao

J. Comb. Theory B, 2007

Rainbow Turán Problems.

Peter Keevash, Dhruv Mubayi, Benny Sudakov, Jacques Verstraëte

Comb. Probab. Comput., 2007

2006

Set Systems with No Singleton Intersection.

Peter Keevash, Dhruv Mubayi, Richard M. Wilson

SIAM J. Discret. Math., 2006

Sparse halves in triangle-free graphs.

Peter Keevash, Benny Sudakov

J. Comb. Theory B, 2006

On a restricted cross-intersection problem.

Peter Keevash, Benny Sudakov

J. Comb. Theory A, 2006

On the minimal degree implying equality of the largest triangle-free and bipartite subgraphs.

József Balogh, Peter Keevash, Benny Sudakov

J. Comb. Theory B, 2006

Pairwise intersections and forbidden configurations.

Richard P. Anstee, Peter Keevash

Eur. J. Comb., 2006

A random construction for permutation codes and the covering radius.

Peter Keevash, Cheng Yeaw Ku

Des. Codes Cryptogr., 2006

Bounding the Number of Edges in Permutation Graphs.

Peter Keevash, Po-Shen Loh, Benny Sudakov

Electron. J. Comb., 2006

2005

Set Systems with Restricted Cross-Intersections and the Minimum Rank of Inclusion Matrices.

Peter Keevash, Benny Sudakov

SIAM J. Discret. Math., 2005

The Turán problem for projective geometries.

Peter Keevash

J. Comb. Theory A, 2005

Disjoint representability of sets and their complements.

József Balogh, Peter Keevash, Benny Sudakov

J. Comb. Theory B, 2005

The Turán Problem for Hypergraphs of Fixed Size.

Peter Keevash

Electron. J. Comb., 2005

On A Hypergraph Turán Problem Of Frankl.

Peter Keevash, Benny Sudakov

Comb., 2005

The Turán Number Of The Fano Plane.

Peter Keevash, Benny Sudakov

Comb., 2005

2004

Packing triangles in a graph and its complement.

Peter Keevash, Benny Sudakov

J. Graph Theory, 2004

On the number of edges not covered by monochromatic copies of a fixed graph.

Peter Keevash, Benny Sudakov

J. Comb. Theory B, 2004

Stability theorems for cancellative hypergraphs.

Peter Keevash, Dhruv Mubayi

J. Comb. Theory B, 2004

Multicoloured extremal problems.

Béla Bollobás, Peter Keevash, Benny Sudakov

J. Comb. Theory A, 2004

Multicolour Turán problems.

Peter Keevash, Michael E. Saks, Benny Sudakov, Jacques Verstraëte

Adv. Appl. Math., 2004

2003

Local Density In Graphs With Forbidden Subgraphs.

Peter Keevash, Benny Sudakov

Comb. Probab. Comput., 2003