Keevash, Peter
- The existence of designs
2014/01/15 by Peter Keevash, Keevash, Peter · 21 citations
Engineering · Mathematics · Computer Science · #graph theory and CDMA systems #Limits and Structures in Graph Theory #Coding theory and cryptography
- Spectral extremal problems for hypergraphs
2013/03/30 by Keevash, Peter, Lenz, John, Mubayi, Dhruv · 6 citations
#Combinatorics (math.CO) #FOS: Mathematics
- Dynamic concentration of the triangle-free process
2013/02/24 by Bohman, Tom, Keevash, Peter · 4 citations
#Combinatorics (math.CO) #FOS: Mathematics
- Counting designs
2015/04/11 by Keevash, Peter · 3 citations
#Combinatorics (math.CO) #FOS: Mathematics
- Hypercontractivity for global functions and sharp thresholds
2019/06/13 by Peter Keevash, Noam Lifshitz, Keevash, Peter +5 · 4 citations
Mathematics · Computer Science · #Limits and Structures in Graph Theory #semigroups and automata theory #Coding theory and cryptography
- Triangle packings and 1-factors in oriented graphs
2008/06/12 by Keevash, Peter, Sudakov, Benny · 2 citations
#05C20 #05C70 #Combinatorics (math.CO) #FOS: Mathematics
- Global hypercontractivity and its applications
2021/03/08 by Keevash, Peter, Lifshitz, Noam, Long, Eoin +1 · 3 citations
#Combinatorics (math.CO) #FOS: Mathematics
- Forbidden intersections for codes
2021/03/08 by Keevash, Peter, Lifshitz, Noam, Long, Eoin +1 · 3 citations
#Combinatorics (math.CO) #FOS: Mathematics
- Equiangular Lines and Spherical Codes in Euclidean Space
2016/06/21 by Balla, Igor, Dräxler, Felix, Keevash, Peter +1 · 2 citations
#Combinatorics (math.CO) #FOS: Mathematics
- Cycle-complete Ramsey numbers
2018/07/17 by Keevash, Peter, Long, Eoin, Skokan, Jozef · 2 citations
#05D10 #Combinatorics (math.CO) #FOS: Mathematics
- The existence of designs II
2018/02/16 by Keevash, Peter · 2 citations
#Combinatorics (math.CO) #FOS: Mathematics
- Homomorphisms from the torus
2020/09/17 by Jenssen, Matthew, Keevash, Peter · 2 citations
#Combinatorics (math.CO) #FOS: Mathematics #Probability (math.PR)
- Ringel's tree packing conjecture in quasirandom graphs
2020/04/21 by Peter Keevash, Katherine Staden, Keevash, Peter +1 · 2 citations
Computer Science · Mathematics · #Advanced Graph Theory Research #Combinatorics (math.CO) #FOS: Mathematics #Graph Labeling and Dimension Problems #Limits and Structures in Graph Theory
- The generalised Oberwolfach problem
2020/04/21 by Keevash, Peter, Staden, Katherine · 2 citations
#Combinatorics (math.CO) #FOS: Mathematics
- On a hypergraph Turan problem of Frankl
2002/11/11 by Peter Keevash, Keevash, Peter, Benny Sudakov +1 · 1 citation
Mathematics · #05C35 #05C65 #05D05 #05E35 #Analytic Number Theory Research #Combinatorics (math.CO) #FOS: Mathematics #Graph theory and applications #Limits and Structures in Graph Theory #math.CO #msc:05C35 #msc:05C65 #msc:05D05 #msc:05E35
- A short proof of the existence of designs
2024/11/27 by Keevash, Peter · 5 citations
#Combinatorics (math.CO) #FOS: Mathematics
- Pancyclicity of Hamiltonian and highly connected graphs
2009/03/26 by Keevash, Peter, Sudakov, Benny · 1 citation
#05C38 #05C45 #Combinatorics (math.CO) #FOS: Mathematics
- A hypergraph blow-up lemma
2010/11/05 by Keevash, Peter · 1 citation
#Combinatorics (math.CO) #FOS: Mathematics
- The optimal edge-colouring threshold
2022/12/08 by Keevash, Peter · 2 citations
#Combinatorics (math.CO) #FOS: Mathematics
- Turan numbers for bipartite graphs plus an odd cycle
2012/10/14 by Peter Allen, Peter Keevash, Allen, Peter +5 · 1 citation
Mathematics · #Limits and Structures in Graph Theory #Graph theory and applications #Finite Group Theory Research
- A hypergraph Turán theorem via lagrangians of intersecting families
2013/07/31 by Hefetz, Dan, Keevash, Peter · 1 citation
#Combinatorics (math.CO) #FOS: Mathematics
- Frankl-Rödl type theorems for codes and permutations
2014/02/25 by Peter Keevash, Keevash, Peter, Eoin Long +1 · 1 citation
Computer Science · Engineering · Mathematics · #05D05 #05D40 #94B65 #Coding theory and cryptography #Combinatorics (math.CO) #FOS: Computer and information sciences #FOS: Mathematics #Information Theory (cs.IT) #Limits and Structures in Graph Theory #graph theory and CDMA systems
- On the Largest Product-free Subsets of the Alternating Groups
2022/05/30 by Keevash, Peter, Lifshitz, Noam, Minzer, Dor · 2 citations
#Combinatorics (math.CO) #FOS: Mathematics
- A stability result for the cube edge isoperimetric inequality
2017/03/29 by Keevash, Peter, Long, Eoin · 1 citation
#05C35 (Primary) 06E30 #05D40 (Secondary) #Combinatorics (math.CO) #FOS: Mathematics
- Hypergraph matchings and designs
2018/07/16 by Keevash, Peter · 1 citation
#Combinatorics (math.CO) #FOS: Mathematics
- A universal exponent for homeomorphs
2020/04/06 by Keevash, Peter, Long, Jason, Narayanan, Bhargav +1 · 1 citation
#05C35 #Combinatorics (math.CO) #FOS: Mathematics #Primary 05E45 #Secondary 05C65
- New bounds for Ryser's conjecture and related problems
2020/05/01 by Keevash, Peter, Pokrovskiy, Alexey, Sudakov, Benny +1 · 1 citation
#05B15 #05D15 #Combinatorics (math.CO) #FOS: Mathematics #G.2.1
- Cyclic subsets in regular Dirac graphs
2025/03/03 by Nemanja Draganić, Draganić, Nemanja, Peter Keevash +3 · 3 citations
Computer Science · Engineering · Mathematics · #05C35 #05C65 #05C70 #Advanced Graph Theory Research #Combinatorics (math.CO) #FOS: Mathematics #Limits and Structures in Graph Theory #graph theory and CDMA systems
- Sharp hypercontractivity for symmetric groups and its applications
2023/07/27 by Keevash, Peter, Lifshitz, Noam · 2 citations
#Combinatorics (math.CO) #FOS: Mathematics #Group Theory (math.GR) #Number Theory (math.NT)