LSE creators

Number of items: 9.
2024
  • Allen, Peter, Böttcher, Julia, Corsten, Jan, Davies, Ewan, Jenssen, Matthew, Morris, Patrick, Roberts, Barnaby, Skokan, Jozef (2024). A robust Corrádi–Hajnal theorem. Random Structures and Algorithms, 65(1), 61-130. https://doi.org/10.1002/rsa.21209 picture_as_pdf
    • 2022
  • Allen, Peter, Böttcher, Julia, Hng, Eng Keat, Skokan, Jozef, Davies, Ewan (2022). An approximate blow-up lemma for sparse hypergraphs. Procedia Computer Science, 195, 394 - 403. https://doi.org/10.1016/j.procs.2021.11.048 picture_as_pdf
    • 2017
  • Davies, Ewan, Jenssen, Matthew, Perkins, Will, Roberts, Barnaby (2017). Independent sets, matchings, and occupancy fractions. Journal of the London Mathematical Society, 96(1), 47-66. https://doi.org/10.1112/jlms.12056
  • Davies, Ewan, Jenssen, Matthew, Roberts, Barnaby, Perkins, Will (2017). Tight bounds on the coefficients of partition functions via stability. Electronic Notes in Discrete Mathematics, 61, 317-321. https://doi.org/10.1016/j.endm.2017.06.054
  • Davies, Ewan, Jenssen, Matthew, Perkins, Will, Roberts, Barnaby (2017). On the average size of independent sets in triangle-free graphs. Proceedings of the American Mathematical Society, 146(1), 111-124. https://doi.org/10.1090/proc/13728
  • Davies, Ewan, Jenssen, Matthew, Roberts, Barnaby (2017). Multicolour Ramsey numbers of paths and even cycles. European Journal of Combinatorics, 63, 124-133. https://doi.org/10.1016/j.ejc.2017.03.002
  • Davies, Ewan (2017). Extremal and probabilistic results for regular graphs [Doctoral thesis]. London School of Economics and Political Science. https://doi.org/10.21953/lse.bijk2dsj3hlb
    • 2016
  • Davies, Ewan (2016). Counting the number of ways a gas can fill a room.
    • 2015
  • Davies, Ewan (2015). Counting in hypergraphs via regularity inheritance. Electronic Notes in Discrete Mathematics, 49, 413-417. https://doi.org/10.1016/j.endm.2015.06.058