Peter Keevash

From MaRDI portal
Person:388724

Available identifiers

zbMath Open keevash.peterDBLP44/2719WikidataQ15990099 ScholiaQ15990099MaRDI QIDQ388724

List of research outcomes





PublicationDate of PublicationType
On Ruzsa's discrete Brunn-Minkowski conjecture2025-01-22Paper
On the length of directed paths in digraphs2024-12-18Paper
The sharp doubling threshold for approximate convexity2024-11-07Paper
Sharp bounds for a discrete John's theorem2024-11-05Paper
On the largest product-free subsets of the alternating groups2024-08-12Paper
Forbidden intersections for codes2023-12-19Paper
Hypercontractivity for global functions and sharp thresholds2023-10-19Paper
Dynamic concentration of the triangle‐free process2023-10-11Paper
Isoperimetric stability in lattices2023-10-11Paper
Sharp bounds for the Tao-Vu Discrete John's Theorem2023-09-21Paper
Homomorphisms from the torus2023-08-28Paper
Sharp hypercontractivity for symmetric groups and its applications2023-07-27Paper
On Ruzsa's discrete Brunn-Minkowski conjecture2023-06-22Paper
The sharp doubling threshold for approximate convexity2023-04-03Paper
The optimal edge-colouring threshold2022-12-08Paper
The existence of subspace designs2022-12-01Paper
Finding matchings in dense hypergraphs2022-10-23Paper
On the Largest Product-free Subsets of the Alternating Groups2022-05-30Paper
New bounds for Ryser’s conjecture and related problems2022-04-22Paper
The generalised Oberwolfach problem2021-11-17Paper
The $n$-queens problem2021-09-16Paper
A universal exponent for homeomorphs2021-08-24Paper
Cycle-Complete Ramsey Numbers2021-08-09Paper
On the number of symbols that forces a transversal2021-06-15Paper
Global hypercontractivity and its applications2021-03-08Paper
Finding Perfect Matchings in Dense Hypergraphs2021-02-02Paper
Global rigidity of direction-length frameworks2020-09-24Paper
Stability for vertex isoperimetry in the cube2020-09-24Paper
HYPERGRAPH MATCHINGS AND DESIGNS2020-09-22Paper
Algorithms for #BIS-Hard Problems on Expander Graphs2020-08-03Paper
The Brown-Erd\H{o}s-S\'os Conjecture for hypergraphs of large uniformity2020-07-29Paper
Distinct degrees in induced subgraphs2020-07-21Paper
Coloured and Directed Designs2020-07-08Paper
Forbidden vector‐valued intersections2020-07-03Paper
Ringel's tree packing conjecture in quasirandom graphs2020-04-21Paper
Rainbow factors in hypergraphs2020-02-21Paper
The extremal number of Venn diagrams2019-11-01Paper
Algorithms for #BIS-hard problems on expander graphs2019-10-15Paper
Counting Steiner triple systems2018-11-14Paper
Rainbow Matchings in Properly Colored Multigraphs2018-07-18Paper
Counting designs2018-04-24Paper
The existence of designs II2018-02-16Paper
Equiangular lines and spherical codes in Euclidean space2018-01-26Paper
Equiangular lines and subspaces in Euclidean spaces2018-01-18Paper
A stability result for the cube edge isoperimetric inequality2018-01-12Paper
The Structure of Typical Eye-Free Graphs and a Turán-Type Result for Two Weighted Colours2017-10-27Paper
On the Normalized Shannon Capacity of a Union2017-10-10Paper
Frankl-Rödl-type theorems for codes and permutations2016-11-16Paper
Bounds for spherical codes2016-02-24Paper
A multipartite Hajnal-Szemerédi theorem2015-06-22Paper
Spectral Extremal Problems for Hypergraphs2015-04-17Paper
A geometric theory for hypergraph matching2015-02-03Paper
Polynomial-time perfect matchings in dense hypergraphs2014-11-26Paper
Turán numbers of bipartite graphs plus an odd cycle2014-08-28Paper
An approximate vertex-isoperimetric inequality for \(r\)-sets2014-08-14Paper
Polynomial-time perfect matchings in dense hypergraphs2014-08-07Paper
Dynamic concentration of the triangle-free process2014-06-11Paper
https://portal.mardi4nfdi.de/entity/Q54199562014-06-11Paper
A hypergraph Turán theorem via Lagrangians of intersecting families2014-06-11Paper
On a conjecture of Erdős and Simonovits: even cycles2014-03-17Paper
The existence of designs2014-01-15Paper
A hypergraph Turán theorem via Lagrangians of intersecting families2014-01-06Paper
Digraph girth via chromatic number2013-09-26Paper
Finding Hamilton cycles in robustly expanding digraphs2012-12-04Paper
The Turán number of \(F_{3,3}\)2012-06-04Paper
A hypergraph blow-up lemma2011-10-25Paper
https://portal.mardi4nfdi.de/entity/Q30893682011-08-24Paper
A Semiexact Degree Condition for Hamilton Cycles in Digraphs2011-06-17Paper
Bounded direction-length frameworks2011-06-10Paper
Necessary conditions for the global rigidity of direction-length frameworks2011-06-10Paper
Set systems without a simplex or a cluster2011-04-26Paper
Loose Hamilton cycles in hypergraphs2011-03-08Paper
https://portal.mardi4nfdi.de/entity/Q35766522010-07-30Paper
The early evolution of the \(H\)-free process2010-07-06Paper
Pancyclicity of Hamiltonian and highly connected graphs2010-06-03Paper
Directed Graphs Without Short Cycles2010-04-23Paper
Triangle packings and 1-factors in oriented graphs2009-06-23Paper
A hypergraph regularity method for generalized Turán problems2009-03-04Paper
An exact minimum degree condition for Hamilton cycles in oriented graphs2009-02-06Paper
Shadows and intersections: Stability and new proofs2008-07-10Paper
Set Systems with No Singleton Intersection2007-11-16Paper
Codegree problems for projective geometries2007-10-10Paper
Rainbow Turán Problems2007-03-20Paper
On the minimal degree implying equality of the largest triangle-free and bipartite subgraphs2007-01-16Paper
On a restricted cross-intersection problem2006-12-07Paper
A random construction for permutation codes and the covering radius2006-11-22Paper
Pairwise intersections and forbidden configurations2006-11-15Paper
Bounding the number of edges in permutation graphs2006-08-30Paper
Sparse halves in triangle-free graphs2006-07-12Paper
On a hypergraph Turán problem of Frankl2006-06-27Paper
The Turán number of the Fano plane2006-06-27Paper
The Turán problem for hypergraphs on fixed size2005-11-01Paper
The Turán problem for projective geometries2005-09-28Paper
Disjoint representability of sets and their complements2005-09-28Paper
Set Systems with Restricted Cross-Intersections and the Minimum Rank ofInclusion Matrices2005-09-16Paper
THE NUMBER OF EDGE COLORINGS WITH NO MONOCHROMATIC CLIQUES2005-03-14Paper
Packing triangles in a graph and its complement2005-02-16Paper
Multicolour Turán problems2004-10-12Paper
Stability theorems for cancellative hypergraphs2004-10-01Paper
Multicoloured extremal problems2004-10-01Paper
The characteristic polynomial of a random permutation matrix.2004-09-22Paper
On the number of edges not covered by monochromatic copies of a fixed graph.2004-03-15Paper
Local Density in Graphs with Forbidden Subgraphs2003-09-24Paper
On the length of directed paths in digraphsN/APaper
Balanced two-type annihilation: mean-field asymptoticsN/APaper
Dissipative particle systems on expandersN/APaper
Locality in SumsetsN/APaper
Long induced paths in expandersN/APaper

Research outcomes over time

This page was built for person: Peter Keevash