Luke Postle

From MaRDI portal
Person:273166

Available identifiers

zbMath Open postle.lukeMaRDI QIDQ273166

List of research outcomes

PublicationDate of PublicationType
Edge-colouring graphs with local list sizes2024-01-15Paper
Asymptotically good edge correspondence colourings2023-10-05Paper
The list linear arboricity of graphs2023-10-04Paper
On the density of critical graphs with no large cliques2023-10-04Paper
An improved bound for the linear arboricity conjecture2023-10-04Paper
Exponentially Many Correspondence Colourings of Planar and Locally Planar Graphs2023-09-29Paper
Decomposing random regular graphs into stars2023-08-30Paper
Local Hadwiger's conjecture2023-08-10Paper
Breaking the degeneracy barrier for coloring graphs with no \(K_t\) minor2023-04-27Paper
Hyperbolicity Theorems for Correspondence Colouring2023-03-29Paper
On generalized Ramsey numbers in the non-integral regime2022-12-20Paper
Connectivity and choosability of graphs with no \(K_t\) minor2022-11-23Paper
The limit in the $(k+2, k)$-Problem of Brown, Erd\H{o}s and S\'os exists for all $k\geq 2$2022-10-03Paper
On the density of \(C_7\)-critical graphs2022-06-30Paper
Structure in sparse \(k\)-critical graphs2022-06-10Paper
Triangle-free planar graphs with at most \(64^{n^{0.731}}\) 3-colorings2022-06-10Paper
Colouring graphs with sparse neighbourhoods: bounds and applications2022-04-27Paper
11/4-colorability of subcubic triangle-free graphs2022-04-26Paper
Finding an almost perfect matching in a hypergraph avoiding forbidden submatchings2022-04-19Paper
The chromatic number of triangle-free hypergraphs2022-02-06Paper
Corrigendum to: ``A local epsilon version of Reed's conjecture2021-09-16Paper
Five-List-Coloring Graphs on Surfaces: The Many Faces Far-Apart Generalization of Thomassen's Theorem2021-08-29Paper
Local girth choosability of planar graphs2021-08-06Paper
Bounding the number of cycles in a graph in terms of its degree sequence2021-02-08Paper
Progress towards Nash-Williams' conjecture on triangle decompositions2021-02-03Paper
3-list-coloring graphs of girth at least five on surfaces2021-02-03Paper
Further Progress towards the List and Odd Versions of Hadwiger's Conjecture2020-10-12Paper
On decidability of hyperbolicity2020-10-04Paper
Fractional vertex-arboricity of planar graphs2020-09-25Paper
An even better Density Increment Theorem and its application to Hadwiger's Conjecture2020-06-25Paper
Further progress towards Hadwiger's conjecture2020-06-21Paper
A local epsilon version of Reed's conjecture2020-01-15Paper
List coloring with requests2019-12-30Paper
On the clique number of the square of a line graph and its relation to maximum degree of the line graph2019-12-30Paper
Halfway to Hadwiger's Conjecture2019-11-04Paper
Breaking the degeneracy barrier for coloring graphs with no $K_t$ minor2019-10-21Paper
Improved Bounds for Randomly Sampling Colorings via Linear Programming2019-10-15Paper
Bounded diameter arboricity2019-04-25Paper
Linear-Time and Efficient Distributed Algorithms for List Coloring Graphs on Surfaces2019-04-07Paper
On the Density of $C_7$-Critical Graphs2019-03-11Paper
Planar graphs of girth at least five are square \((\delta + 2)\)-choosable2018-12-20Paper
Hyperbolic families and coloring graphs on surfaces2018-12-05Paper
Fractional coloring with local demands2018-11-28Paper
On the Minimal Edge Density of $K_4$-free 6-critical Graphs2018-11-07Paper
Asymptotically good edge correspondence colouring2018-08-26Paper
Random 4-regular graphs have 3-star decompositions asymptotically almost surely2018-06-28Paper
Chromatic index determined by fractional chromatic index2018-05-09Paper
Rapid mixing of Glauber dynamics for colorings below Vigoda's $11/6$ threshold2018-04-11Paper
Density of 5/2-critical graphs2018-03-16Paper
Exponentially many 4‐list‐colorings of triangle‐free graphs on surfaces2018-02-23Paper
Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 82018-02-09Paper
Characterizing 4-critical graphs with Ore-degree at most seven2018-02-09Paper
On star decompositions of random regular graphs2018-01-18Paper
On the list coloring version of Reed's conjecture2018-01-18Paper
Corrigendum to: ``A local epsilon version of Reed's conjecture2018-01-18Paper
On the Minimum Edge‐Density of 4‐Critical Graphs of Girth Five2017-12-01Paper
Five-list-coloring graphs on surfaces. III: One list of size one and one list of size two2017-11-28Paper
Modified linear programming and class 0 bounds for graph pebbling2017-10-17Paper
Reconstruction of infinite matroids from their 3-connected minors2017-10-10Paper
On the minimum number of edges in triangle-free 5-critical graphs2017-09-11Paper
On the clique number of the square of a line graph and its relation to Ore-degree2017-08-07Paper
5-list-coloring planar graphs with distant precolored vertices2016-11-25Paper
On the minimum edge-density of 5-critical triangle-free graphs2016-10-14Paper
Five-list-coloring graphs on surfaces. II: A linear bound for critical graphs in a disk.2016-04-21Paper
The structure of 2-separations of infinite matroids2015-12-11Paper
Five-list-coloring graphs on surfaces. I. Two lists of size two in planar graphs2015-03-05Paper
Pebbling Graphs of Fixed Diameter2014-05-22Paper
https://portal.mardi4nfdi.de/entity/Q28573122013-11-01Paper
https://portal.mardi4nfdi.de/entity/Q28573212013-11-01Paper
Pebbling Graphs of Diameter Three and Four2013-10-10Paper
Sub-Exponentially Many 3-Colorings of Triangle-Free Planar Graphs2013-10-10Paper
Six-Critical Graphs on the Klein Bottle2013-06-28Paper
Pebbling Graphs of Diameter Three and Four2013-04-19Paper
Five-coloring graphs on the Klein bottle2012-10-19Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Luke Postle