• Peter Keevash (born 30 November 1978) is a British mathematician, working in combinatorics. He is a professor of mathematics at the University of Oxford...
    4 KB (384 words) - 16:26, 18 June 2023
  • Thumbnail for Steiner system
    whether infinitely many have t = 4 or 5. Both existences were proved by Peter Keevash in 2014. His proof is non-constructive and, as of 2019, no actual Steiner...
    28 KB (3,889 words) - 05:55, 13 October 2024
  • Mouhot, Ruth Baker, Tom Coates, Daniela Kühn and Deryk Osthus 2015 Peter Keevash, James Maynard, Christoph Ortner, Mason Porter, Dominic Vella, David...
    8 KB (799 words) - 18:21, 29 June 2024
  • Alain Plagne 2005 Dmitry Feichtner-Kozlov 2007 Gilles Schaeffer 2009 Peter Keevash, Balázs Szegedy 2011 David Conlon, Daniel Kráľ 2013 Wojciech Samotij...
    4 KB (306 words) - 16:14, 20 March 2024
  • Thumbnail for József Balogh (mathematician)
    Research jointly with Robert Morris and Wojciech Samotij. with Noga Alon, Peter Keevash, Benny Sudakov: The number of edge colorings with no monochromatic cliques...
    7 KB (738 words) - 08:17, 10 October 2024
  • Thumbnail for Benny Sudakov
    Probabilistic Combinatorics and Their Algorithmic Aspects  (1999) Doctoral advisor Noga Alon Doctoral students Jacob Fox Hao Huang Peter Keevash Po-Shen Loh...
    4 KB (251 words) - 18:19, 2 September 2024
  • graphs into dense graphs. A hypergraph variant was developed later by Peter Keevash. He is member of the editorial board of the European Journal of Combinatorics...
    2 KB (241 words) - 21:33, 29 April 2022
  • Thumbnail for Turán graph
    (2003). "Computing high-stringency COGs using Turán type graphs" (PDF). Keevash, Peter; Sudakov, Benny (2003). "Local density in graphs with forbidden subgraphs"...
    10 KB (1,262 words) - 13:42, 15 July 2024
  • an improvement to the randomized algorithm to make it deterministic. Peter Keevash found a generalization of the blow-up lemma to hypergraphs in 2010....
    18 KB (2,789 words) - 23:54, 11 August 2024
  • Rinat Kashaev Fanny Kassel Neeraj Kayal Yasuyuki Kawahigashi Sean Keel Peter Keevash Richard Kenyon Moritz Kerz [de] Jong Hae Keum Konstantin Khanin Alexander...
    118 KB (10,718 words) - 01:02, 6 September 2024
  • Number R(3,k)". bookstore.ams.org. Retrieved 2023-06-27. Bohman, Tom; Keevash, Peter (2020-11-17). "Dynamic concentration of the triangle-free process"....
    63 KB (7,928 words) - 14:10, 26 October 2024
  • Thumbnail for Latin square
    115 (7): 1103–1113. doi:10.1016/j.jcta.2008.01.002. ISSN 0097-3165. Keevash, Peter; Pokrovskiy, Alexey; Sudakov, Benny; Yepremyan, Liana (2022-04-15)....
    31 KB (3,698 words) - 08:05, 22 October 2024
  • Thumbnail for Johnson graph
    2140/pjm.1963.13.389, MR 0157909. Christofides, Demetres; Ellis, David; Keevash, Peter (2013), "An Approximate Vertex-Isoperimetric Inequality for $r$-sets"...
    10 KB (1,283 words) - 21:27, 14 August 2024
  • Thumbnail for 3-dimensional matching
    626–636, doi:10.1007/978-3-642-10631-6_64, ISBN 978-3-642-10630-9. Keevash, Peter; Knox, Fiachra; Mycroft, Richard (2013), "Polynomial-time perfect matchings...
    13 KB (1,551 words) - 10:22, 13 October 2024
  • n-queens configurations". arXiv:1705.05225v2 [math.CO]. Bowtell, Candida; Keevash, Peter (16 September 2021). "The $n$-queens problem". arXiv:2109.08083v1 [math...
    33 KB (3,623 words) - 16:55, 19 October 2024
  • Thumbnail for Oberwolfach problem
    (8): 2511–2547, arXiv:1806.04644, doi:10.4171/jems/1060, MR 4269420 Keevash, Peter; Staden, Katherine (2022), "The generalised Oberwolfach problem" (PDF)...
    12 KB (1,451 words) - 00:25, 30 August 2024
  • to equal-angle lines", Quanta Magazine. Balla, Igor; Dräxler, Felix; Keevash, Peter; Sudakov, Benny (2016). "Equiangular Lines and Spherical Codes in Euclidean...
    9 KB (1,209 words) - 15:57, 26 September 2024
  • packing Ramsey's theorem Set cover problem Sphere packing Steiner system Keevash, Peter; Pokrovskiy, Alexey; Sudakov, Benny; Yepremyan, Liana (2022-04-15)....
    14 KB (2,452 words) - 20:06, 3 January 2024
  • 09477. doi:10.1016/j.dam.2019.12.018. ISSN 0166-218X. S2CID 119602376. Keevash, Peter; Mycroft, Richard (2015-01-01). A geometric theory for hypergraph matching...
    19 KB (2,606 words) - 00:07, 30 April 2024
  • and Combinatorial Mathematics By Kenneth H. Rosen, John G. Michaels p. 590 Keevash, Peter. "Hypergraph Turán Problems" (PDF). Retrieved 2 December 2019....
    24 KB (4,298 words) - 08:07, 11 January 2024
  • 115 (7): 1103–1113. doi:10.1016/j.jcta.2008.01.002. ISSN 0097-3165. Keevash, Peter; Pokrovskiy, Alexey; Sudakov, Benny; Yepremyan, Liana (2022-04-15)....
    46 KB (6,498 words) - 19:56, 12 October 2024
  • 115 (7): 1103–1113. doi:10.1016/j.jcta.2008.01.002. ISSN 0097-3165. Keevash, Peter; Pokrovskiy, Alexey; Sudakov, Benny; Yepremyan, Liana (2022-04-15)....
    21 KB (2,561 words) - 06:53, 22 July 2024