Degree sequences forcing Hamilton cycles in directed graphs. - Daniela Kühn; Deryk Osthus; Andrew Treglown (Electron. Notes Discret. Math., 2009)

An Ore-type Theorem for Perfect Packings in Graphs. - Daniela Kühn; Deryk Osthus; Andrew Treglown (SIAM J. Discret. Math., 2009)

Hamiltonian degree sequences in digraphs. - Daniela Kühn; Deryk Osthus; Andrew Treglown (J. Comb. Theory B, 2010)

Matchings in 3-uniform hypergraphs of large minimum vertex degree. - Andrew Treglown; Daniela Kühn; Deryk Osthus (Electron. Notes Discret. Math., 2011)

Exact minimum degree thresholds for perfect matchings in uniform hypergraphs. - Andrew Treglown; Yi Zhao 005 (J. Comb. Theory A, 2012)

A note on some embedding problems for oriented graphs. - Andrew Treglown (J. Graph Theory, 2012)

On Perfect Packings in Dense Graphs. - József Balogh; Alexandr V. Kostochka; Andrew Treglown (Electron. J. Comb., 2013)

Embedding Spanning Bipartite Graphs of Small Bandwidth. - Fiachra Knox; Andrew Treglown (Comb. Probab. Comput., 2013)

Monochromatic triangles in three-coloured graphs. - James Cummings 001; Daniel Král'; Florian Pfender; Konrad Sperfeld; Andrew Treglown; Michael Young (J. Comb. Theory B, 2013)

Matchings in 3-uniform hypergraphs. - Daniela Kühn; Deryk Osthus; Andrew Treglown (J. Comb. Theory B, 2013)

Exact minimum degree thresholds for perfect matchings in uniform hypergraphs II. - Andrew Treglown; Yi Zhao 005 (J. Comb. Theory A, 2013)

A random version of Sperner's theorem. - József Balogh; Richard Mycroft; Andrew Treglown (J. Comb. Theory A, 2014)

On Directed Versions of the Hajnal-Szemerédi Theorem. - Andrew Treglown (Comb. Probab. Comput., 2015)

A sharp bound on the number of maximal sum-free sets. - József Balogh; Hong Liu 010; Maryam Sharifzadeh; Andrew Treglown (Electron. Notes Discret. Math., 2015)

On a degree sequence analogue of Pósa's conjecture. - Katherine Staden; Andrew Treglown (Electron. Notes Discret. Math., 2015)

A Note on Perfect Matchings in Uniform Hypergraphs. - Andrew Treglown; Yi Zhao 005 (Electron. J. Comb., 2016)

Enumerating solution-free sets in the integers. - Robert Hancock 002; Andrew Treglown (Electron. Notes Discret. Math., 2016)

A degree sequence Hajnal-Szemerédi theorem. - Andrew Treglown (J. Comb. Theory B, 2016)

Applications of graph containers in the Boolean lattice. - József Balogh; Andrew Treglown; Zsolt Adam Wagner (Random Struct. Algorithms, 2016)

Exact Minimum Codegree Threshold for K - 4-Factors. - Jie Han 002; Allan Lo; Andrew Treglown; Yi Zhao 005 (Comb. Probab. Comput., 2017)

On solution-free sets of integers. - Robert Hancock 002; Andrew Treglown (Eur. J. Comb., 2017)

On Degree Sequences Forcing The Square of a Hamilton Cycle. - Katherine Staden; Andrew Treglown (SIAM J. Discret. Math., 2017)

On the complexity of finding and counting solution-free sets of integers. - Kitty Meeks; Andrew Treglown (Discret. Appl. Math., 2018)

Preface. - Allan Lo; Richard Mycroft; Guillem Perarnau; Andrew Treglown (BCC, 2019)

Tilings in Randomly Perturbed Dense Graphs. - József Balogh; Andrew Treglown; Zsolt Adam Wagner (Comb. Probab. Comput., 2019)

Independent Sets in Hypergraphs and Ramsey Properties of Graphs and the Integers. - Robert Hancock 002; Katherine Staden; Andrew Treglown (SIAM J. Discret. Math., 2019)

A Degree Sequence Komlós Theorem. - Joseph Hyde; Hong Liu 010; Andrew Treglown (SIAM J. Discret. Math., 2019)

A Degree Sequence Version of the Kühn-Osthus Tiling Theorem. - Joseph Hyde; Andrew Treglown (Electron. J. Comb., 2020)

Ramsey properties of randomly perturbed graphs: cliques and cycles. - Shagnik Das; Andrew Treglown (Comb. Probab. Comput., 2020)

The complexity of perfect matchings and packings in dense hypergraphs. - Jie Han 002; Andrew Treglown (J. Comb. Theory B, 2020)

Vertex Ramsey properties of randomly perturbed graphs. - Shagnik Das; Patrick Morris 001; Andrew Treglown (Random Struct. Algorithms, 2020)

Existence thresholds and Ramsey properties of random posets. - Victor Falgas-Ravry; Klas Markström; Andrew Treglown; Yi Zhao 005 (Random Struct. Algorithms, 2020)

A discrepancy version of the Hajnal-Szemerédi theorem. - József Balogh; Béla Csaba; András Pluhár; Andrew Treglown (Comb. Probab. Comput., 2021)

Tilings in randomly perturbed graphs: Bridging the gap between Hajnal-Szemerédi and Johansson-Kahn-Vu. - Jie Han 002; Patrick Morris 001; Andrew Treglown (Random Struct. Algorithms, 2021)

Transitive Tournament Tilings in Oriented Graphs with Large Minimum Total Degree. - Louis DeBiasio; Allan Lo; Theodore Molla; Andrew Treglown (SIAM J. Discret. Math., 2021)

A Note on Color-Bias Hamilton Cycles in Dense Graphs. - Andrea Freschi; Joseph Hyde; Joanna Lada; Andrew Treglown (SIAM J. Discret. Math., 2021)

On Maximal Sum-Free Sets in Abelian Groups. - Nathanaël Hassler; Andrew Treglown (Electron. J. Comb., 2022)

On deficiency problems for graphs. - Andrea Freschi; Joseph Hyde; Andrew Treglown (Comb. Probab. Comput., 2022)

Complete subgraphs in a multipartite graph. - Allan Lo; Andrew Treglown; Yi Zhao 005 (Comb. Probab. Comput., 2022)

Tilings in vertex ordered graphs. - József Balogh; Lina Li; Andrew Treglown (J. Comb. Theory B, 2022)

Extremal problems for multigraphs. - A. Nicholas Day; Victor Falgas-Ravry; Andrew Treglown (J. Comb. Theory B, 2022)

An asymmetric random Rado theorem for single equations: The 0-statement. - Robert Hancock 002; Andrew Treglown (Random Struct. Algorithms, 2022)

The induced saturation problem for posets. - Andrea Freschi; Simón Piga; Maryam Sharifzadeh; Andrew Treglown (Comb. Theory, 2023)

On Some Extremal and Probabilistic Questions for Tree Posets. - Balázs Patkós; Andrew Treglown (Electron. J. Comb., 2024)

Tiling Edge-Ordered Graphs with Monotone Paths and Other Structures. - Igor Araujo; Simón Piga; Andrew Treglown; Zimu Xiang (SIAM J. Discret. Math., 2024)

A Note on Color-Bias Perfect Matchings in Hypergraphs. - József Balogh; Andrew Treglown; Camila Zárate-Guerén (SIAM J. Discret. Math., 2024)

On oriented cycles in randomly perturbed digraphs. - Igor Araujo; József Balogh; Robert A. Krueger; Simón Piga; Andrew Treglown (Comb. Probab. Comput., 2024)