Luke Postle

457 total citations
35 papers, 116 citations indexed

About

Luke Postle is a scholar working on Computational Theory and Mathematics, Discrete Mathematics and Combinatorics and Geometry and Topology. According to data from OpenAlex, Luke Postle has authored 35 papers receiving a total of 116 indexed citations (citations by other indexed papers that have themselves been cited), including 35 papers in Computational Theory and Mathematics, 24 papers in Discrete Mathematics and Combinatorics and 14 papers in Geometry and Topology. Recurrent topics in Luke Postle's work include Advanced Graph Theory Research (31 papers), Limits and Structures in Graph Theory (24 papers) and Graph Labeling and Dimension Problems (16 papers). Luke Postle is often cited by papers focused on Advanced Graph Theory Research (31 papers), Limits and Structures in Graph Theory (24 papers) and Graph Labeling and Dimension Problems (16 papers). Luke Postle collaborates with scholars based in Canada, United States and France. Luke Postle's co-authors include Marthe Bonamy, Sergey Norin, Zdenĕk Dvořák, Robin Thomas, Daniel W. Cranston, Michael Molloy, Zi‐Xia Song, Guantao Chen, Nathan Chenette and Ankur Moitra and has published in prestigious journals such as Advances in Mathematics, Proceedings of the American Mathematical Society and Journal of the American Mathematical Society.

In The Last Decade

Luke Postle

26 papers receiving 106 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
Luke Postle Canada	6	110	80	24	15	14	35	116
Marthe Bonamy France	9	175 1.6×	86 1.1×	33 1.4×	28 1.9×	29 2.1×	34	188
Alexey Pokrovskiy United Kingdom	7	100 0.9×	90 1.1×	47 2.0×	45 3.0×	15 1.1×	23	130
Julia Böttcher United Kingdom	8	143 1.3×	153 1.9×	76 3.2×	36 2.4×	9 0.6×	33	186
Sophie Spirkl United States	7	141 1.3×	99 1.2×	47 2.0×	30 2.0×	8 0.6×	52	164
Deepak Rajendraprasad India	6	166 1.5×	78 1.0×	34 1.4×	22 1.5×	39 2.8×	24	172
Casey Tompkins Hungary	7	72 0.7×	78 1.0×	43 1.8×	18 1.2×	3 0.2×	35	109
Nicolas Trotignon France	10	202 1.8×	107 1.3×	23 1.0×	24 1.6×	32 2.3×	38	205
Benjamin Lévêque France	8	156 1.4×	68 0.8×	24 1.0×	18 1.2×	34 2.4×	28	167
T. Karthick India	10	228 2.1×	136 1.7×	45 1.9×	20 1.3×	13 0.9×	32	237
Edita Máčajová Slovakia	9	193 1.8×	113 1.4×	46 1.9×	49 3.3×	30 2.1×	46	207

Countries citing papers authored by Luke Postle

Since Specialization

Citations

This map shows the geographic impact of Luke Postle's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Luke Postle with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Luke Postle more than expected).

Fields of papers citing papers by Luke Postle

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Luke Postle. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Luke Postle. The network helps show where Luke Postle may publish in the future.

Co-authorship network of co-authors of Luke Postle

This figure shows the co-authorship network connecting the top 25 collaborators of Luke Postle. A scholar is included among the top collaborators of Luke Postle based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Luke Postle. Luke Postle is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Postle, Luke, et al.. (2024). Fractional coloring with local demands and applications to degree-sequence bounds on the independence number. Journal of Combinatorial Theory Series B. 169. 298–337.

Postle, Luke, et al.. (2024). Improving the Caro–Wei bound and applications to Turán stability. Discrete Applied Mathematics. 358. 33–43. 1 indexed citations

Postle, Luke, et al.. (2023). The limit in the (𝑘+2,𝑘)-problem of Brown, Erdős and Sós exists for all 𝑘≥2. Proceedings of the American Mathematical Society. 2 indexed citations

Norin, Sergey, Luke Postle, & Zi‐Xia Song. (2023). Breaking the degeneracy barrier for coloring graphs with no K minor. Advances in Mathematics. 422. 109020–109020. 5 indexed citations

Bonamy, Marthe, et al.. (2023). Edge-colouring graphs with local list sizes. Journal of Combinatorial Theory Series B. 165. 68–96. 3 indexed citations

Postle, Luke, et al.. (2023). An Improved Bound for the Linear Arboricity Conjecture. COMBINATORICA. 43(3). 547–569. 4 indexed citations

Bonamy, Marthe, et al.. (2022). Bounding χ by a fraction of Δ for graphs without large cliques. Journal of Combinatorial Theory Series B. 157. 263–282. 6 indexed citations

Gould, Ronald J., et al.. (2022). Structure in sparse k-critical graphs. Journal of Combinatorial Theory Series B. 156. 194–222.

Bonamy, Marthe, et al.. (2022). Colouring graphs with sparse neighbourhoods: Bounds and applications. Journal of Combinatorial Theory Series B. 155. 278–317. 12 indexed citations

10.

Molloy, Michael & Luke Postle. (2022). Asymptotically good edge correspondence colourings. Journal of Graph Theory. 100(3). 559–577. 4 indexed citations

11.

Chen, Sitan, et al.. (2019). Improved bounds for randomly sampling colorings via linear programming. arXiv (Cornell University). 2216–2234. 3 indexed citations

12.

Postle, Luke, et al.. (2019). On the clique number of the square of a line graph and its relation to maximum degree of the line graph. Journal of Graph Theory. 92(3). 261–274. 9 indexed citations

13.

Nelson, Peter S., et al.. (2019). The Structure of Binary Matroids with no Induced Claw or Fano Plane Restriction. 1 indexed citations

14.

Chen, Guantao, et al.. (2018). Chromatic index determined by fractional chromatic index. Journal of Combinatorial Theory Series B. 131. 85–108. 5 indexed citations

15.

Diestel, Reinhard, et al.. (2015). The structure of 2-separations of infinite matroids. Journal of Combinatorial Theory Series B. 116. 25–56.

16.

Postle, Luke & Robin Thomas. (2015). Five-list-coloring graphs on surfaces II. A linear bound for critical graphs in a disk. Journal of Combinatorial Theory Series B. 119. 42–65.

17.

Postle, Luke & Robin Thomas. (2014). Five-list-coloring graphs on surfaces I. Two lists of size two in planar graphs. Journal of Combinatorial Theory Series B. 111. 234–241. 1 indexed citations

18.

Dvořák, Zdenĕk, et al.. (2013). Sub-exponentially many 3-colorings of triangle-free planar graphs. Journal of Combinatorial Theory Series B. 103(6). 706–712. 5 indexed citations

19.

Chenette, Nathan, et al.. (2012). Five-coloring graphs on the Klein bottle. Journal of Combinatorial Theory Series B. 102(5). 1067–1098. 2 indexed citations

20.

Postle, Luke, et al.. (2009). Sub-Exponentially Many 3-Colorings of Triangle-Free Planar Graphs. Electronic Notes in Discrete Mathematics. 34. 81–87. 4 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact