default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPeter Keevash
Person information
- affiliation: University of Oxford, Mathematical Institute, Oxford, UK
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j53]Peter van Hintum, Peter Keevash:
Sharp bounds for a discrete John's theorem. Comb. Probab. Comput. 33(4): 484-486 (2024)- [c4]Chung Shue Chen, Peter Keevash, Sean Kennedy, Élie de Panafieu, Adrian Vetta:
Robot Positioning Using Torus Packing for Multisets. ICALP 2024: 43:1-43:18 - [i6]Chung Shue Chen, Peter Keevash, Sean Kennedy, Élie de Panafieu, Adrian Vetta:
Robot Positioning Using Torus Packing for Multisets. CoRR abs/2404.09981 (2024) - 2022
- [j52]Peter Keevash, Katherine Staden:
The generalised Oberwolfach problem. J. Comb. Theory B 152: 281-318 (2022) - [i5]Jie Han, Peter Keevash:
Finding matchings in dense hypergraphs. CoRR abs/2210.12643 (2022) - 2021
- [j51]Tom Bohman
, Peter Keevash:
Dynamic concentration of the triangle-free process. Random Struct. Algorithms 58(2): 221-293 (2021) - 2020
- [j50]Peter Keevash, Liana Yepremyan:
On the number of symbols that forces a transversal. Comb. Probab. Comput. 29(2): 234-240 (2020) - [j49]Matthew Coulson, Peter Keevash, Guillem Perarnau, Liana Yepremyan:
Rainbow factors in hypergraphs. J. Comb. Theory A 172: 105184 (2020) - [j48]Peter Keevash, Eoin Long:
Stability for vertex isoperimetry in the cube. J. Comb. Theory B 145: 113-144 (2020) - [j47]Katie Clinch, Bill Jackson, Peter Keevash:
Global rigidity of direction-length frameworks. J. Comb. Theory B 145: 145-168 (2020) - [j46]Matthew Jenssen, Peter Keevash, Will Perkins:
Algorithms for #BIS-Hard Problems on Expander Graphs. SIAM J. Comput. 49(4): 681-710 (2020) - [c3]Jie Han, Peter Keevash:
Finding Perfect Matchings in Dense Hypergraphs. SODA 2020: 2366-2377
2010 – 2019
- 2019
- [c2]Matthew Jenssen, Peter Keevash, Will Perkins:
Algorithms for #BIS-hard problems on expander graphs. SODA 2019: 2235-2247 - 2018
- [j45]Peter Keevash, Eoin Long:
A stability result for the cube edge isoperimetric inequality. J. Comb. Theory A 155: 360-375 (2018) - [j44]Peter Keevash, Liana Yepremyan:
Rainbow Matchings in Properly Colored Multigraphs. SIAM J. Discret. Math. 32(3): 1577-1584 (2018) - [i4]Peter Keevash, Liana Yepremyan:
On the number of symbols that forces a transversal. CoRR abs/1805.10911 (2018) - [i3]Matthew Jenssen, Peter Keevash, Will Perkins:
Algorithms for #BIS-hard problems on expander graphs. CoRR abs/1807.04804 (2018) - 2017
- [j43]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): 886-910 (2017) - [j42]Igor Balla, Felix Dräxler, Peter Keevash, Benny Sudakov:
Equiangular lines and subspaces in Euclidean spaces. Electron. Notes Discret. Math. 61: 85-91 (2017) - [i2]Peter Keevash, Liana Yepremyan:
Rainbow matchings in properly-coloured multigraphs. CoRR abs/1710.03041 (2017) - 2016
- [j41]Peter Keevash, Eoin Long:
On the Normalized Shannon Capacity of a Union. Comb. Probab. Comput. 25(5): 766-767 (2016) - 2015
- [j40]Peter Keevash, Richard Mycroft:
A multipartite Hajnal-Szemerédi theorem. J. Comb. Theory B 114: 187-236 (2015) - 2014
- [j39]Peter Allen, Peter Keevash, Benny Sudakov, Jacques Verstraëte:
Turán numbers of bipartite graphs plus an odd cycle. J. Comb. Theory B 106: 134-162 (2014) - [j38]Peter Keevash, John Lenz, Dhruv Mubayi:
Spectral Extremal Problems for Hypergraphs. SIAM J. Discret. Math. 28(4): 1838-1854 (2014) - [i1]Peter Keevash, Eoin Long:
Frankl-Rödl type theorems for codes and permutations. CoRR abs/1402.6294 (2014) - 2013
- [j37]Peter Keevash, Benny Sudakov, Jacques Verstraëte:
On a conjecture of Erdős and Simonovits: Even cycles. Comb. 33(6): 699-732 (2013) - [j36]Demetres Christofides, David Ellis, Peter Keevash:
An Approximate Vertex-Isoperimetric Inequality for r-sets. Electron. J. Comb. 20(4): 15 (2013) - [j35]Dan Hefetz, Peter Keevash:
A hypergraph Turán theorem via lagrangians of intersecting families. J. Comb. Theory A 120(8): 2020-2038 (2013) - [j34]Peter Keevash, Zhentao Li, Bojan Mohar, Bruce A. Reed:
Digraph Girth via Chromatic Number. SIAM J. Discret. Math. 27(2): 693-696 (2013) - [c1]Peter Keevash, Fiachra Knox, Richard Mycroft:
Polynomial-time perfect matchings in dense hypergraphs. STOC 2013: 311-320 - 2012
- [j33]Peter Keevash, Dhruv Mubayi:
The Turán Number of F3, 3. Comb. Probab. Comput. 21(3): 451-456 (2012) - [j32]Demetres Christofides, Peter Keevash, Daniela Kühn, Deryk Osthus:
Finding Hamilton cycles in robustly expanding digraphs. J. Graph Algorithms Appl. 16(2): 335-358 (2012) - 2011
- [j31]Bill Jackson, Peter Keevash:
Bounded Direction-Length Frameworks. Discret. Comput. Geom. 46(1): 48-71 (2011) - [j30]Bill Jackson, Peter Keevash:
Necessary Conditions for the Global Rigidity of Direction-Length Frameworks. Discret. Comput. Geom. 46(1): 72-85 (2011) - [j29]Peter Keevash, Daniela Kühn, Richard Mycroft, Deryk Osthus:
Loose Hamilton cycles in hypergraphs. Discret. Math. 311(7): 544-559 (2011) - [j28]Peter Keevash:
A hypergraph blow-up lemma. Random Struct. Algorithms 39(3): 275-376 (2011) - 2010
- [j27]Peter Keevash, Dhruv Mubayi:
Set systems without a simplex or a cluster. Comb. 30(2): 175-200 (2010) - [j26]Jacob Fox, Peter Keevash, Benny Sudakov:
Directed Graphs Without Short Cycles. Comb. Probab. Comput. 19(2): 285-301 (2010) - [j25]Peter Keevash, Benny Sudakov:
Pancyclicity of Hamiltonian and highly connected graphs. J. Comb. Theory B 100(5): 456-467 (2010) - [j24]Demetres Christofides, Peter Keevash, Daniela Kühn, Deryk Osthus:
A Semiexact Degree Condition for Hamilton Cycles in Digraphs. SIAM J. Discret. Math. 24(3): 709-756 (2010)
2000 – 2009
- 2009
- [j23]Peter Keevash, Benny Sudakov:
Triangle packings and 1-factors in oriented graphs. J. Comb. Theory B 99(4): 709-727 (2009) - [j22]Peter Keevash:
A hypergraph regularity method for generalized Turán problems. Random Struct. Algorithms 34(1): 123-164 (2009) - 2007
- [j21]Peter Keevash, Dhruv Mubayi, Benny Sudakov, Jacques Verstraëte:
Rainbow Turán Problems. Comb. Probab. Comput. 16(1): 109-126 (2007) - [j20]Peter Keevash, Yi Zhao:
Codegree problems for projective geometries. J. Comb. Theory B 97(6): 919-928 (2007) - 2006
- [j19]Peter Keevash, Po-Shen Loh, Benny Sudakov:
Bounding the Number of Edges in Permutation Graphs. Electron. J. Comb. 13(1) (2006) - [j18]Peter Keevash, Cheng Yeaw Ku:
A random construction for permutation codes and the covering radius. Des. Codes Cryptogr. 41(1): 79-86 (2006) - [j17]Richard P. Anstee, Peter Keevash:
Pairwise intersections and forbidden configurations. Eur. J. Comb. 27(8): 1235-1248 (2006) - [j16]Peter Keevash, Benny Sudakov:
Sparse halves in triangle-free graphs. J. Comb. Theory B 96(4): 614-620 (2006) - [j15]József Balogh, Peter Keevash, Benny Sudakov:
On the minimal degree implying equality of the largest triangle-free and bipartite subgraphs. J. Comb. Theory B 96(6): 919-932 (2006) - [j14]Peter Keevash, Benny Sudakov:
On a restricted cross-intersection problem. J. Comb. Theory A 113(7): 1536-1542 (2006) - [j13]Peter Keevash, Dhruv Mubayi, Richard M. Wilson:
Set Systems with No Singleton Intersection. SIAM J. Discret. Math. 20(4): 1031-1041 (2006) - 2005
- [j12]Peter Keevash, Benny Sudakov:
The Turán Number Of The Fano Plane. Comb. 25(5): 561-574 (2005) - [j11]Peter Keevash, Benny Sudakov:
On A Hypergraph Turán Problem Of Frankl. Comb. 25(6): 673-706 (2005) - [j10]Peter Keevash:
The Turán Problem for Hypergraphs of Fixed Size. Electron. J. Comb. 12 (2005) - [j9]József Balogh, Peter Keevash, Benny Sudakov:
Disjoint representability of sets and their complements. J. Comb. Theory B 95(1): 12-28 (2005) - [j8]Peter Keevash:
The Turán problem for projective geometries. J. Comb. Theory A 111(2): 289-309 (2005) - [j7]Peter Keevash, Benny Sudakov:
Set Systems with Restricted Cross-Intersections and the Minimum Rank of Inclusion Matrices. SIAM J. Discret. Math. 18(4): 713-727 (2005) - 2004
- [j6]Peter Keevash, Michael E. Saks, Benny Sudakov, Jacques Verstraëte:
Multicolour Turán problems. Adv. Appl. Math. 33(2): 238-262 (2004) - [j5]Peter Keevash, Benny Sudakov:
On the number of edges not covered by monochromatic copies of a fixed graph. J. Comb. Theory B 90(1): 41-53 (2004) - [j4]Peter Keevash, Dhruv Mubayi:
Stability theorems for cancellative hypergraphs. J. Comb. Theory B 92(1): 163-175 (2004) - [j3]Béla Bollobás, Peter Keevash, Benny Sudakov:
Multicoloured extremal problems. J. Comb. Theory A 107(2): 295-312 (2004) - [j2]Peter Keevash, Benny Sudakov:
Packing triangles in a graph and its complement. J. Graph Theory 47(3): 203-216 (2004) - 2003
- [j1]Peter Keevash, Benny Sudakov:
Local Density In Graphs With Forbidden Subgraphs. Comb. Probab. Comput. 12(2): 139-153 (2003)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-05 21:41 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
