Michelle Delcourt
Journal Papers
- 9. A Nonalgorithmic Short Proof of the Containers Theorems for Hypergraphs.
Anton Bernshteyn, Michelle Delcourt, Henry Towsner, and Anush Tserunyan.
10 pages. Submitted. [PDF]
- 8. 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.
15 pages; 8 figures. Submitted. [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