Michelle Delcourt

Journal Papers

• 17. Finding an almost perfect matching in a hypergraph avoiding forbidden submatchings.
  Michelle Delcourt and Luke Postle.
  Submitted. [PDF]
• 16. Reducing Linear Hadwiger's Conjecture to Coloring Small Graphs.
  Michelle Delcourt and Luke Postle.
  Submitted. [PDF]
• 15. A combinatorial method for connecting BHV spaces representing different numbers of taxa.
  Jingwen Bi, Ruth Davidson, Michelle Delcourt, Rosemary Guzman, Cara Monical, José A. Sanchez, Yingying Ren, and Sihan Zha.
  Submitted. 15 pages; 8 figures. [PDF]
• 14. Rapid mixing of Glauber dynamics for colorings below Vigoda's 11/6 threshold.
  Michelle Delcourt, Guillem Perarnau, and Luke Postle.
  Submitted. 21 pages. [PDF]
• 13. Edge-colouring graphs with local list sizes.
  Marthe Bonamy, Michelle Delcourt, Richard Lang, and Luke Postle.
  Accepted with Revisions. [PDF]
• 12. Generalized Rainbow Turan Numbers of Odd Cycles.
  Jozsef Balogh, Michelle Delcourt, Emily Heath, and Lina Li.
  Discrete Mathematics, Vol 345, Issue 2, (2022).
  6 pages. [PDF]
• 11. Independent Sets in Algebraic Hypergraphs.
  Anton Bernshteyn, Michelle Delcourt, and Anush Tserunyan.
  Journal of the European Mathematical Society, Vol 24, No 1, (2021), 1 - 35.
  26 pages. [PDF]
• 10. Progress towards Nash-Williams' Conjecture on Triangle Decompositions.
  Michelle Delcourt and Luke Postle.
  J. Comb. Theory Ser. B, Vol 146, (2021), 382 - 416.
  28 pages. [PDF]
• 9. The Glauber dynamics for edges colourings of trees.
  Michelle Delcourt, Marc Heinrich, and Guillem Perarnau.
  Random Structures and Algorithms, Vol 57, Issue 4, (2020).
  27 pages. [PDF]
• 8. A Nonalgorithmic Short Proof of the Containers Theorems for Hypergraphs.
  Anton Bernshteyn, Michelle Delcourt, Henry Towsner, and Anush Tserunyan.
  Proceedings of the AMS, Vol 147, No 4, (2019), 1739 - 1749.
  10 pages. [PDF]
• 7. Random 4-regular graphs have 3-star-decompositions asymptotically almost surely.
  Michelle Delcourt and Luke Postle.
  European Journal of Combinatorics, 72C (2018), 97 - 111.
  18 pages; 1 figure. [PDF]
• 6. Counting rainbow copies of $C_4$ in edge-colored hypercubes.
  József Balogh, Michelle Delcourt, Bernard Lidický, and Cory Palmer.
  Discrete Applied Mathematics, 210 (2016), 35 - 37.
  4 pages. [PDF]
• 5. On a Conjecture of Thomassen.
  Michelle Delcourt and Asaf Ferber.
  Electronic Journal of Combinatorics, Volume 22, Paper 3.2 (2015), 1 - 8.
  8 pages. [PDF]
• 4. Intersecting families of discrete structures are typically trivial.
  József Balogh, Shagnik Das, Michelle Delcourt, Hong Liu, and Maryam Sharifzadeh.
  J. Combinatorial Theory Ser. A, 132 (2015), 224 - 245.
  19 pages. [PDF]
• 3. Taking the Convoluted out of Bernoulli Convolutions: A Discrete Approach.
  Neil J. Calkin, Julia Davis, Michelle Delcourt, Zebediah Engberg, Jobby Jacob,
  and Kevin James.
  INTEGERS, 13 (2013), no. 19, pp. 1 - 12.
  12 pages; 3 figures, 2 tables. [PDF]
• 2. Locating a robber on a graph via distance queries.
  James Carraher, Ilkyoo Choi, Michelle Delcourt, Lawrence H. Erickson, Douglas B. West.
  Journal of Theoretical Computer Science, Vol. 463, No. 7, December 2012, pp. 54 - 61.
  10 pages; 5 figures. [PDF]
• 1. Discrete Bernoulli Convolutions.
  Neil J. Calkin, Julia Davis, Michelle Delcourt, Zebediah Engberg, Jobby Jacob,
  and Kevin James.
  Proceedings of the AMS, Volume 139, Number 5, May 2011, pp. 1579 - 1584.
  6 pages; 1 figure. [PDF]

Conference Papers

• 3. Improved Bounds for Randomly Sampling Colorings via Linear Programming.
  Sitan Chen, Michelle Delcourt, Ankur Moitra, Guillem Perarnau, and Luke Postle. Proceedings of the 30th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2019), to appear. [PDF]
• 2. On the List Coloring Version of Reed's Conjecture.
  Michelle Delcourt and Luke Postle.
  Electronic Notes in Discrete Mathematics, Vol. 61 (2017), pp. 343 - 349.
• 1. On Star Decompositions of Random Regular Graphs.
  Michelle Delcourt and Luke Postle.
  Electronic Notes in Discrete Mathematics, Vol. 61 (2017), pp. 339 - 342.