Author pages are created from data sourced from our academic publisher partnerships and public sources.

- Publications
- Influence

Improved Bounds for Randomly Sampling Colorings via Linear Programming

- S. Chen, M. Delcourt, A. Moitra, G. Perarnau, L. Postle
- Computer Science, Mathematics
- SODA
- 30 October 2018

A well-known conjecture in computer science and statistical physics is that Glauber dynamics on the set of $k$-colorings of a graph $G$ on $n$ vertices with maximum degree $\Delta$ is rapidly mixing… Expand

Progress towards Nash-Williams' Conjecture on Triangle Decompositions

- M. Delcourt, L. Postle
- Mathematics
- 2 September 2019

Partitioning the edges of a graph into edge disjoint triangles forms a triangle decomposition of the graph. A famous conjecture by Nash-Williams from 1970 asserts that any sufficiently large,… Expand

Intersecting families of discrete structures are typically trivial

- J. Balogh, S. Das, M. Delcourt, H. Liu, M. Sharifzadeh
- Computer Science, Mathematics
- J. Comb. Theory, Ser. A
- 11 August 2014

The study of intersecting structures is central to extremal combinatorics. A family of permutations F ? S n is t-intersecting if any two permutations in F agree on some t indices, and is trivial if… Expand

Locating a robber on a graph via distance queries

- James M. Carraher, Ilkyoo Choi, M. Delcourt, Lawrence H. Erickson, D. West
- Mathematics, Computer Science
- Theor. Comput. Sci.
- 1 December 2012

A cop wants to locate a robber hiding among the vertices of a graph. A round of the game consists of the robber moving to a neighbor of its current vertex (or not moving) and then the cop scanning… Expand

Rapid mixing of Glauber dynamics for colorings below Vigoda's 11/6 threshold

- M. Delcourt, G. Perarnau, L. Postle
- Mathematics, Computer Science
- ArXiv
- 11 April 2018

A well-known conjecture in computer science and statistical physics is that Glauber dynamics on the set of $k$-colorings of a graph $G$ on $n$ vertices with maximum degree $\Delta$ is rapidly mixing… Expand

On the List Coloring Version of Reed's Conjecture

- M. Delcourt, L. Postle
- Computer Science, Mathematics
- Electron. Notes Discret. Math.
- 1 August 2017

Abstract The chromatic number of a graph is bounded below by its clique number and from above by its maximum degree plus one. In 1998, Reed conjectured that the chromatic number is at most halfway in… Expand

The typical structure of intersecting families of discrete structures

- J. Balogh, S. Das, M. Delcourt, H. Liu, M. Sharifzadeh
- Mathematics
- 11 August 2014

The study of intersecting structures is central to extremal combinatorics. A family of permutations F ⊂ Sn is t-intersecting if any two permutations in F agree on some t indices, and is trivial if… Expand

- 14

Rainbow copies of C4 in edge-colored hypercubes

- J. Balogh, M. Delcourt, B. Lidický, C. Palmer
- Computer Science, Mathematics
- Discret. Appl. Math.
- 10 September 2016

For positive integers k and d such that 4 ź k < d and k ź 5 , we determine the maximum number of rainbow colored copies of C 4 in a k -edge-coloring of the d -dimensional hypercube Q d .… Expand

On a Conjecture of Thomassen

- M. Delcourt, A. Ferber
- Mathematics, Computer Science
- Electron. J. Comb.
- 18 October 2014

In 1989, Thomassen asked whether there is an integer-valued function $f(k)$ such that every $f(k)$-connected graph admits a spanning, bipartite $k$-connected subgraph. In this paper we take a first,… Expand

A combinatorial method for connecting BHV spaces representing different numbers of taxa

- Jingwen Bi, R. Davidson, +5 authors Sihan Zha
- Biology, Mathematics
- 8 August 2017

The phylogenetic tree space introduced by Billera, Holmes, and Vogtmann (BHV tree space) is a CAT(0) continuous space that represents trees with edge weights with an intrinsic geodesic distance… Expand