29. Delcourt, M. and L. Postle. A Proof of Nash-Williams’ Conjecture.
28. Delcourt, M., C. Henderson, T. Lesgourgues, and L. Postle. Erdős meets Nash-Williams.
27. Delcourt, M., T. Kelly, and L. Postle. A Short Proof of the Existence of $K_q^r$-absorbers.
26. Delcourt, M., T. Kelly, and L. Postle. Clique Decompositions in Random Graphs via Refined Absorption.
25. Delcourt, M. and L. Postle. Proof of the High Girth Existence Conjecture via Refined Absorption.
24. Delcourt, M. and L. Postle. Refined Absorption: A New Proof of the Existence Conjecture.
23. Delcourt, M. and L. Postle. Finding an almost perfect matching in a hypergraph avoiding forbidden submatchings. Accepted to Journal of the LMS.
22. Delcourt, M., T. Kelly, and L. Postle. Thresholds for (n, q, 2)-Steiner Systems via Refined Absorption. Accepted to Mathematical Proceedings of the Cambridge Philosophical Society.
21. Delcourt, M., C. Henderson, T. Lesgourgues, and L. Postle. Beyond Nash-Williams: Counterexamples to Clique Decomposition Thresholds for All Cliques Larger than Triangles. Accepted to Proceedings of the AMS.
20. Delcourt, M., T. Lesgourgues, and L. Postle. Fractional Clique Decompositions of Dense Hypergraphs. Bulletin of the LMS, Volume 58, Issue 5, 2026.
19. Bennett, P., M. Delcourt, L. Li, and L. Postle. On generalized Ramsey numbers in the non-integral regime. Electronic Journal of Combinatorics, Volume 33, Number 2, 2026.
18. Delcourt, M., C. Greenhill, M. Isaev, B. Lidicky, and L. Postle. Decomposing random regular graphs into stars. European Journal of Combinatorics, Volume 130, 2025, 104216.
17. Bernshteyn, A., M. Delcourt, A. Ferber and H. Pham. Sunflowers in set systems with small VC-dimension. Combinatorica, Volume 45, Number 58, 2025.
16. Delcourt, M., R. Huq, and P. Pralat. Almost all 9-regular graphs have a modular 5-orientation. Electronic Journal of Cominbatorics, Volume 32, Paper 2.22: 1–23, 2025.
15. Delcourt, M. and L. Postle. Reducing Linear Hadwiger’s Conjecture to Coloring Small Graphs. Journal of the AMS, Vol. 38: 481–507, April 2025.
14. Delcourt, M. and L. Postle. The limit in the (k+2,k)-Problem of Brown, Erdős and Sós exists for all k≥2. Proceedings of the AMS, Vol. 152, No. 5: 1881–1891, May 2024.
13. Bonamy, M., M. Delcourt, R. Lang, and L. Postle. Edge-colouring graphs with local list sizes. J. Comb. Theory Ser. B, Vol 165: 68–96, 2024.
12. Balogh, J., M. Delcourt, E. Heath, and L. Li. Generalized Rainbow Turán Numbers of Odd Cycles. Discrete Mathematics, Vol 345, Issue 2, 2022.
11. Bernshteyn, A., M. Delcourt, and A. Tserunyan. Independent Sets in Algebraic Hypergraphs. Journal of the European Mathematical Society, Vol 24, No 1: 1–35, 2021.
10. Delcourt, M. and L. Postle. Progress towards Nash-Williams’ Conjecture on Triangle Decompositions. J. Comb. Theory Ser. B, Vol 146: 382–416, 2021.
9. Delcourt, M., M. Heinrich, and G. Perarnau. The Glauber dynamics for edges colourings of trees. Random Structures and Algorithms, Vol 57, Issue 4, 2020.
8. Bernshteyn, A., M. Delcourt, H. Towsner, and A. Tserunyan. A Nonalgorithmic Short Proof of the Containers Theorems for Hypergraphs. Proceedings of the AMS, Vol 147, No 4: 1739–1749, 2010.
7. Delcourt, M. and L. Postle. Random 4-regular graphs have 3-star-decompositions asymptotically almost surely. European Journal of Combinatorics,72C: 97–111, 2018.
6. Balogh, J., M. Delcourt, B. Lidický, and C. Palmer. Counting rainbow copies of C4 in edge-colored hypercubes. Discrete Applied Mathematics, 210: 35–37, 2016.
5. Delcourt, M. and A. Ferber. On a Conjecture of Thomassen. Electronic Journal of Combinatorics, Volume 22, Paper 3.2: 1–8, 2015.
4. Balogh, J., S. Das, M. Delcourt, H. Liu, and M. Sharifzadeh. Intersecting families of discrete structures are typically trivial. J. Comb. Theory Ser. A, Vol. 132: 224–245, 2015.
3. Calkin, N.J., J. Davis, M. Delcourt, Z. Engberg, J. Jacob, and K. James. Taking the Convoluted out of Bernoulli Convolutions: A Discrete Approach. Integers, 13, no. 19: 1–12, 2013.
2. Carraher, J., I. Choi, M. Delcourt, L. Erickson, and D.B. West. Locating a robber on a graph via distance queries. Journal of Theoretical Computer Science, Vol. 463: 54–61, 2012.
1. Calkin, N.J., J. Davis, M. Delcourt, Z. Engberg, J. Jacob, and K. James. Discrete Bernoulli Convolutions. Proceedings of the AMS, Vol. 139, No. 5: 1579–1584, May 2011.
4. Bonamy, M, M. Delcourt, R. Lang, and L. Postle. Asymptotically good local list edge colourings. Acta Mathematica Universitatis Comenianae, 88.3: 489–494, 2019.
3. Chen, S, M. Delcourt, A. Moitra, G. Perarnau, and L. Postle. Improved Bounds for Randomly Sampling Colorings via Linear Programming. Proceedings of the 30th Annual ACMSIAM Symposium on Discrete Algorithms, SODA 2019.
2. Delcourt, M and L. Postle. On the List Coloring Version of Reed’s Conjecture. Elec. Notes in Discrete Mathematics, Vol. 61: 343–349, 2017.
1. Delcourt, M and L. Postle. On Star Decompositions of Random Regular Graphs. Elec. Notes in Discrete Mathematics, Vol. 61: 339–342, 2017.