Michelle Delcourt

Orcid: 0000-0003-1176-8931

According to our database1, Michelle Delcourt authored at least 16 papers between 2012 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Edge-colouring graphs with local list sizes.
J. Comb. Theory, Ser. B, March, 2024

2022
Generalized rainbow Turán numbers of odd cycles.
Discret. Math., 2022

2021
Progress towards Nash-Williams' conjecture on triangle decompositions.
J. Comb. Theory, Ser. B, 2021

Reducing Linear Hadwiger's Conjecture to Coloring Small Graphs.
CoRR, 2021

2020
The Glauber dynamics for edge-colorings of trees.
Random Struct. Algorithms, 2020

2019
Improved Bounds for Randomly Sampling Colorings via Linear Programming.
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

2018
Random 4-regular graphs have 3-star decompositions asymptotically almost surely.
Eur. J. Comb., 2018

The Glauber dynamics for edges colourings of trees.
CoRR, 2018

Rapid mixing of Glauber dynamics for colorings below Vigoda's 11/6 threshold.
CoRR, 2018

2017
On the List Coloring Version of Reed's Conjecture.
Electron. Notes Discret. Math., 2017

On Star Decompositions of Random Regular Graphs.
Electron. Notes Discret. Math., 2017

2016
Rainbow copies of C<sub>4</sub> in edge-colored hypercubes.
Discret. Appl. Math., 2016

2015
Intersecting families of discrete structures are typically trivial.
J. Comb. Theory, Ser. A, 2015

On a Conjecture of Thomassen.
Electron. J. Comb., 2015

2013
Taking the Convoluted Out of Bernoulli Convolutions: A Discrete Approach.
Integers, 2013

2012
Locating a robber on a graph via distance queries.
Theor. Comput. Sci., 2012


  Loading...