Peter Keevash

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