
On decidability of hyperbolicity
We prove that a wide range of coloring problems in graphs on surfaces ca...
read it

An even better Density Increment Theorem and its application to Hadwiger's Conjecture
In 1943, Hadwiger conjectured that every graph with no K_t minor is (t1...
read it

Further progress towards Hadwiger's conjecture
In 1943, Hadwiger conjectured that every graph with no K_t minor is (t1...
read it

A local epsilon version of Reed's Conjecture
In 1998, Reed conjectured that every graph G satisfies χ(G) ≤1/2(Δ(G) + ...
read it

On the density of critical graphs with no large cliques
A graph G is kcritical if χ(G) = k and every proper subgraph of G is (k...
read it

Halfway to Hadwiger's Conjecture
In 1943, Hadwiger conjectured that every K_tminorfree graph is (t1)c...
read it

LinearTime and Efficient Distributed Algorithms for List Coloring Graphs on Surfaces
In 1994, Thomassen proved that every planar graph is 5listcolorable. I...
read it

Fractional coloring with local demands
We investigate fractional colorings of graphs in which the amount of col...
read it

Improved Bounds for Randomly Sampling Colorings via Linear Programming
A wellknown conjecture in computer science and statistical physics is t...
read it

Colouring Graphs with Sparse Neighbourhoods: Bounds and Applications
Let G be a graph with chromatic number χ, maximum degree Δ and clique nu...
read it

Rapid mixing of Glauber dynamics for colorings below Vigoda's 11/6 threshold
A wellknown conjecture in computer science and statistical physics is t...
read it
Luke Postle
is this you? claim profile