Luke Postle

Publication Activity (10 Years)

Years Active: 2008-2024
Publications (10 Years): 61

Top Topics

Graph Theoretic

Series Parallel

Linear Programming

Top Venues

J. Comb. Theory, Ser. B

J. Graph Theory

Publications

Tom Kelly, Luke Postle
Improving the Caro-Wei bound and applications to Turán stability. Discret. Appl. Math. 358 (2024)
Tom Kelly, Luke Postle
Fractional coloring with local demands and applications to degree-sequence bounds on the independence number. J. Comb. Theory B 169 (2024)
Marthe Bonamy, Michelle Delcourt, Richard Lang, Luke Postle
Edge-colouring graphs with local list sizes. J. Comb. Theory, Ser. B 165 (2024)
Sergey Norin, Luke Postle
minor. J. Comb. Theory, Ser. B 158 (Part) (2023)
Benjamin R. Moore, Luke Postle, Lise Turner
Local Hadwiger's Conjecture. J. Comb. Theory, Ser. B 162 (2023)
Tom Kelly, Luke Postle
On the Density of Critical Graphs with No Large Cliques. Comb. 43 (1) (2023)
Richard Lang, Luke Postle
An Improved Bound for the Linear Arboricity Conjecture. Comb. 43 (3) (2023)
Marthe Bonamy, Thomas Perrett, Luke Postle
Colouring graphs with sparse neighbourhoods: Bounds and applications. J. Comb. Theory, Ser. B 155 (2022)
Marthe Bonamy, Tom Kelly, Peter Nelson, Luke Postle
by a fraction of Δ for graphs without large cliques. J. Comb. Theory, Ser. B 157 (2022)
Michael Molloy, Luke Postle
Asymptotically good edge correspondence colourings. J. Graph Theory 100 (3) (2022)
Luke Postle, Evelyne Smith-Roberge
-Critical Graphs. Comb. 42 (2) (2022)
Zdenek Dvorák, Luke Postle
Triangle-free planar graphs with at most 64n0.731 3-colorings. J. Comb. Theory, Ser. B 156 (2022)
Zdenek Dvorák, Luke Postle
On Decidability of Hyperbolicity. Comb. 42 (6) (2022)
Ronald J. Gould, Victor Larsen, Luke Postle
-critical graphs. J. Comb. Theory, Ser. B 156 (2022)
Lina Li, Luke Postle
The chromatic number of triangle-free hypergraphs. CoRR (2022)
Benjamin Moore, Luke Postle, Lise Turner
Local Hadwiger's Conjecture. CoRR (2022)
Luke Postle
3-List-coloring graphs of girth at least five on surfaces. J. Comb. Theory, Ser. B 147 (2021)
Michelle Delcourt, Luke Postle
Progress towards Nash-Williams' conjecture on triangle decompositions. J. Comb. Theory, Ser. B 146 (2021)
Ringi Kim, Luke Postle
The list linear arboricity of graphs. J. Graph Theory 98 (1) (2021)
Zdenek Dvorák, Natasha Morrison, Jonathan A. Noel, Sergey Norin, Luke Postle
Bounding the number of cycles in a graph in terms of its degree sequence. Eur. J. Comb. 91 (2021)
Michelle Delcourt, Luke Postle
Reducing Linear Hadwiger's Conjecture to Coloring Small Graphs. CoRR (2021)
Tom Kelly, Luke Postle
Corrigendum to "A local epsilon version of Reed's Conjecture" [J. Combin. Theory Ser. B 141 (2020) 181-222]. J. Comb. Theory, Ser. B 151 (2021)
Zdenek Dvorák, Luke Postle
On decidability of hyperbolicity. CoRR (2020)
Luke Postle
Further progress towards Hadwiger's conjecture. CoRR (2020)
Tom Kelly, Luke Postle
A local epsilon version of Reed's Conjecture. J. Comb. Theory, Ser. B 141 (2020)
Luke Postle
An even better Density Increment Theorem and its application to Hadwiger's Conjecture. CoRR (2020)
Luke Postle
Halfway to Hadwiger's Conjecture. CoRR (2019)
Zdenek Dvorák, Sergey Norin, Luke Postle
List coloring with requests. J. Graph Theory 92 (3) (2019)
Tom Kelly, Luke Postle
On the density of critical graphs with no large cliques. CoRR (2019)
Luke Postle
Linear-Time and Efficient Distributed Algorithms for List Coloring Graphs on Surfaces. FOCS (2019)
Luke Postle
Linear-Time and Efficient Distributed Algorithms for List Coloring Graphs on Surfaces. CoRR (2019)
Marthe Bonamy, Daniel W. Cranston, Luke Postle
Planar graphs of girth at least five are square (Δ + 2)-choosable. J. Comb. Theory, Ser. B 134 (2019)
Maxime Faron, Luke Postle
On the clique number of the square of a line graph and its relation to maximum degree of the line graph. J. Graph Theory 92 (3) (2019)
Martin Merker, Luke Postle
Bounded diameter arboricity. J. Graph Theory 90 (4) (2019)
Sitan Chen, Michelle Delcourt, Ankur Moitra, Guillem Perarnau, Luke Postle
Improved Bounds for Randomly Sampling Colorings via Linear Programming. SODA (2019)
Tom Kelly, Luke Postle
A local epsilon version of Reed's Conjecture. CoRR (2019)
Zdenek Dvorák, Luke Postle
Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8. J. Comb. Theory, Ser. B 129 (2018)
Luke Postle, Robin Thomas
Five-list-coloring graphs on surfaces III. One list of size one and one list of size two. J. Comb. Theory, Ser. B 128 (2018)
Sitan Chen, Michelle Delcourt, Ankur Moitra, Guillem Perarnau, Luke Postle
Improved Bounds for Randomly Sampling Colorings via Linear Programming. CoRR (2018)
Tom Kelly, Luke Postle
Fractional coloring with local demands. CoRR (2018)
Michelle Delcourt, Guillem Perarnau, Luke Postle
Rapid mixing of Glauber dynamics for colorings below Vigoda's 11/6 threshold. CoRR (2018)
Guantao Chen, Yuping Gao, Ringi Kim, Luke Postle, Songling Shan
Chromatic index determined by fractional chromatic index. J. Comb. Theory, Ser. B 131 (2018)
Tom Kelly, Luke Postle
Exponentially many 4-list-colorings of triangle-free graphs on surfaces. J. Graph Theory 87 (2) (2018)
Nathan J. Bowler, Johannes Carmesin, Luke Postle
Reconstruction of infinite matroids from their 3-connected minors. Eur. J. Comb. 67 (2018)
Michelle Delcourt, Luke Postle
Random 4-regular graphs have 3-star decompositions asymptotically almost surely. Eur. J. Comb. 72 (2018)
Luke Postle
Characterizing 4-critical graphs with Ore-degree at most seven. J. Comb. Theory, Ser. B 129 (2018)
Marthe Bonamy, Thomas Perrett, Luke Postle
Colouring Graphs with Sparse Neighbourhoods: Bounds and Applications. CoRR (2018)
Michelle Delcourt, Luke Postle
On Star Decompositions of Random Regular Graphs. Electron. Notes Discret. Math. 61 (2017)
Michelle Delcourt, Luke Postle
On the List Coloring Version of Reed's Conjecture. Electron. Notes Discret. Math. 61 (2017)
Chun-Hung Liu, Luke Postle
On the Minimum Edge-Density of 4-Critical Graphs of Girth Five. J. Graph Theory 86 (4) (2017)
Zdenek Dvorák, Bernard Lidický, Bojan Mohar, Luke Postle
5-list-coloring planar graphs with distant precolored vertices. J. Comb. Theory, Ser. B 122 (2017)
Daniel W. Cranston, Luke Postle, Chenxiao Xue, Carl Yerger
Modified linear programming and class 0 bounds for graph pebbling. J. Comb. Optim. 34 (1) (2017)
Luke Postle
On the minimum number of edges in triangle-free 5-critical graphs. Eur. J. Comb. 66 (2017)
Tom Kelly, Luke Postle
A Local Epsilon Version of Reed's Conjecture. Electron. Notes Discret. Math. 61 (2017)
Zdenek Dvorák, Luke Postle
Density of 5/2-critical graphs. Comb. 37 (5) (2017)
Luke Postle, Robin Thomas
Hyperbolic families and coloring graphs on surfaces. CoRR (2016)
Luke Postle, Robin Thomas
Five-list-coloring graphs on surfaces II. A linear bound for critical graphs in a disk. J. Comb. Theory, Ser. B 119 (2016)
Elad Aigner-Horev, Reinhard Diestel, Luke Postle
The structure of 2-separations of infinite matroids. J. Comb. Theory, Ser. B 116 (2016)
Luke Postle, Robin Thomas
Five-list-coloring graphs on surfaces I. Two lists of size two in planar graphs. J. Comb. Theory, Ser. B 111 (2015)
Luke Postle, Robin Thomas
Five-list-coloring graphs on surfaces II. A linear bound for critical graphs in a disk. CoRR (2015)
Luke Postle
On the Minimum Edge-Density of 5-Critical Triangle-Free Graphs. Electron. Notes Discret. Math. 49 (2015)
Luke Postle, Robin Thomas
Five-list-coloring graphs on surfaces I. Two lists of size two in planar graphs. CoRR (2014)
Luke Postle
Pebbling Graphs of Fixed Diameter. J. Graph Theory 75 (4) (2014)
Arash Asadi, Zdenek Dvorák, Luke Postle, Robin Thomas
Sub-exponentially many 3-colorings of triangle-free planar graphs. J. Comb. Theory, Ser. B 103 (6) (2013)
Luke Postle, Noah Streib, Carl Yerger
Pebbling Graphs of Diameter Three and Four. J. Graph Theory 72 (4) (2013)
Zdenek Dvorák, Bernard Lidický, Bojan Mohar, Luke Postle
5-list-coloring planar graphs with distant precolored vertices CoRR (2012)
Nathan Chenette, Luke Postle, Noah Streib, Robin Thomas, Carl Yerger
Five-coloring graphs on the Klein bottle. J. Comb. Theory, Ser. B 102 (5) (2012)
Elad Aigner-Horev, Reinhard Diestel, Luke Postle
Decomposing infinite matroids into their 3-connected minors. Electron. Notes Discret. Math. 38 (2011)
Arash Asadi, Luke Postle, Robin Thomas
Minor-minimal non-projective planar graphs with an internal 3-separation. Electron. Notes Discret. Math. 38 (2011)
Arash Asadi, Luke Postle, Robin Thomas
Sub-Exponentially Many 3-Colorings of Triangle-Free Planar Graphs. Electron. Notes Discret. Math. 34 (2009)
Luke Postle, Noah Streib, Carl Yerger
Pebbling Graphs of Diameter Three and Four. Electron. Notes Discret. Math. 34 (2009)
Nathan Chenette, Luke Postle, Noah Streib, Robin Thomas, Carl Yerger, Ken-ichi Kawarabayashi, Daniel Král, Jan Kyncl, Bernard Lidický
Six-Critical Graphs on the Klein Bottle. Electron. Notes Discret. Math. 31 (2008)