Luke Postle

activity

20162025

most citedConnectivity and choosability of graphs with no

K_{t}

minor

8 citations · 11 across the 9 of their papers we have counts for

collaborators

Showing 2016Show all

2 papers · 1 filter

math.CO2016

Reconstruction of infinite matroids from their 3-connected minors

Nathan Bowler, Johannes Carmesin, Luke Postle

We show that any infinite matroid can be reconstructed from the torsos of a tree-decomposition over its 2-separations, together with local information at the ends of the tree. We s…

math.CO2016

Exponentially Many 4-List-Colorings of Triangle-Free Graphs on Surfaces

Tom Kelly, Luke Postle

Thomassen proved that every planar graph $G$ on $n$ vertices has at least $2^{n /9}$ distinct $L$ -colorings if $L$ is a 5-list-assignment for $G$ and at least $2^{n /10000}$ distinct…