|
 | Up a level |
Allen, Peter 
ORCID: 0000-0001-6555-3501, Böttcher, Julia ORCID: 0000-0002-4104-3635, Corsten, Jan, Davies, Ewan, Jenssen, Matthew, Morris, Patrick, Roberts, Barnaby and Skokan, Jozef ORCID: 0000-0003-3996-7676
(2024)
A robust Corrádi–Hajnal theorem.
Random Structures and Algorithms, 65 (1).
pp. 61-130.
ISSN 1042-9832
Allen, Peter ORCID: 0000-0001-6555-3501, Böttcher, Julia ORCID: 0000-0002-4104-3635, Hng, Eng Keat, Skokan, Jozef ORCID: 0000-0003-3996-7676 and Davies, Ewan
(2022)
An approximate blow-up lemma for sparse hypergraphs.
Procedia Computer Science, 195.
394 - 403.
ISSN 1877-0509
Davies, Ewan, Jenssen, Matthew, Perkins, Will and Roberts, Barnaby (2017) Independent sets, matchings, and occupancy fractions. Journal of the London Mathematical Society, 96 (1). pp. 47-66. ISSN 0024-6107
Davies, Ewan, Jenssen, Matthew, Roberts, Barnaby and Perkins, Will (2017) Tight bounds on the coefficients of partition functions via stability. Electronic Notes in Discrete Mathematics, 61. pp. 317-321. ISSN 1571-0653
Davies, Ewan, Jenssen, Matthew, Perkins, Will and Roberts, Barnaby (2017) On the average size of independent sets in triangle-free graphs. Proceedings of the American Mathematical Society, 146 (1). pp. 111-124. ISSN 0002-9939
Davies, Ewan, Jenssen, Matthew and Roberts, Barnaby (2017) Multicolour Ramsey numbers of paths and even cycles. European Journal of Combinatorics, 63. pp. 124-133. ISSN 0195-6698
Davies, Ewan (2016) Counting the number of ways a gas can fill a room. Maths at LSE (14 Jan 2016). Website.
Davies, Ewan (2015) Counting in hypergraphs via regularity inheritance. Electronic Notes in Discrete Mathematics, 49. pp. 413-417. ISSN 1571-0653
