By Dr Thomas Lesgourgues

Preprints

Boyadzhiyska S; Das S; Lesgourgues T; Petrova K, 2025, Odd-Ramsey numbers of Hamilton cycles, https://arxiv.org/abs/2511.10497v1

Delcourt M; Lesgourgues T; Postle L, 2025, Fractional Clique Decompositions of Dense Hypergraphs, https://arxiv.org/abs/2510.07225v1

Delcourt M; Henderson C; Lesgourgues T; Postle L, 2025, Beyond Nash-Williams: Counterexamples to Clique Decomposition Thresholds for All Cliques Larger than Triangles, https://arxiv.org/abs/2508.20819v2

Delcourt M; Cicely ; Henderson ; Lesgourgues T; Postle L, 2025, Erdős meets Nash-Williams, https://arxiv.org/abs/2507.23624v1

Lesgourgues T; Liebenau A; Taylor N, 2025, Ramsey with purple edges, https://arxiv.org/abs/2505.01034v2

Boyadzhiyska S; Das S; Lesgourgues T; Petrova K, 2024, Odd-Ramsey numbers of complete bipartite graphs, https://arxiv.org/abs/2410.05887v1

Campbell R; Gollin JP; Hendrey K; Lesgourgues T; Mohar B; Tamitegama Y; Tan J; Wood DR, 2024, Clustered Colouring of Graph Products, https://arxiv.org/abs/2407.21360v1

Boyadzhiyska S; Lesgourgues T, 2022, On the use of senders for asymmetric tuples of cliques in Ramsey theory, https://arxiv.org/abs/2211.15840v3

Bishnoi A; Lesgourgues T, 2022, A new upper bound on the minimum degree of minimal Ramsey graphs, https://arxiv.org/abs/2209.05147v2

Bishnoi A; Boyadzhiyska S; Clemens D; Gupta P; Lesgourgues T; Liebenau A, 2021, On the minimum degree of minimal Ramsey graphs for cliques versus cycles, https://arxiv.org/abs/2109.02877v1

Back to profile page