Andrew Treglown

Publication Activity (10 Years)

Years Active: 2009-2024
Publications (10 Years): 33

Top Topics

Closure Operator

Top Venues

Comb. Probab. Comput.

SIAM J. Discret. Math.

Random Struct. Algorithms

Electron. J. Comb.

Publications

Balázs Patkós, Andrew Treglown
On Some Extremal and Probabilistic Questions for Tree Posets. Electron. J. Comb. 31 (1) (2024)
Igor Araujo, József Balogh, Robert A. Krueger, Simón Piga, Andrew Treglown
On oriented cycles in randomly perturbed digraphs. Comb. Probab. Comput. 33 (2) (2024)
Robert Hancock, Andrew Treglown
An asymmetric random Rado theorem for single equations: The 0-statement. Random Struct. Algorithms 60 (4) (2022)
Andrea Freschi, Joseph Hyde, Andrew Treglown
On deficiency problems for graphs. Comb. Probab. Comput. 31 (3) (2022)
József Balogh, Lina Li, Andrew Treglown
Tilings in vertex ordered graphs. J. Comb. Theory, Ser. B 155 (2022)
Nathanaël Hassler, Andrew Treglown
On Maximal Sum-Free Sets in Abelian Groups. Electron. J. Comb. 29 (2) (2022)
A. Nicholas Day, Victor Falgas-Ravry, Andrew Treglown
Extremal problems for multigraphs. J. Comb. Theory, Ser. B 154 (2022)
Allan Lo, Andrew Treglown, Yi Zhao
Complete subgraphs in a multipartite graph. Comb. Probab. Comput. 31 (6) (2022)
József Balogh, Béla Csaba, András Pluhár, Andrew Treglown
A discrepancy version of the Hajnal-Szemerédi theorem. Comb. Probab. Comput. 30 (3) (2021)
Louis DeBiasio, Allan Lo, Theodore Molla, Andrew Treglown
Transitive Tournament Tilings in Oriented Graphs with Large Minimum Total Degree. SIAM J. Discret. Math. 35 (1) (2021)
Andrea Freschi, Joseph Hyde, Joanna Lada, Andrew Treglown
A Note on Color-Bias Hamilton Cycles in Dense Graphs. SIAM J. Discret. Math. 35 (2) (2021)
Jie Han, Patrick Morris, Andrew Treglown
Tilings in randomly perturbed graphs: Bridging the gap between Hajnal-Szemerédi and Johansson-Kahn-Vu. Random Struct. Algorithms 58 (3) (2021)
Jie Han, Andrew Treglown
The complexity of perfect matchings and packings in dense hypergraphs. J. Comb. Theory, Ser. B 141 (2020)
Victor Falgas-Ravry, Klas Markström, Andrew Treglown, Yi Zhao
Existence thresholds and Ramsey properties of random posets. Random Struct. Algorithms 57 (4) (2020)
Shagnik Das, Andrew Treglown
Ramsey properties of randomly perturbed graphs: cliques and cycles. Comb. Probab. Comput. 29 (6) (2020)
Shagnik Das, Patrick Morris, Andrew Treglown
Vertex Ramsey properties of randomly perturbed graphs. Random Struct. Algorithms 57 (4) (2020)
Joseph Hyde, Andrew Treglown
A Degree Sequence Version of the Kühn-Osthus Tiling Theorem. Electron. J. Comb. 27 (3) (2020)
Allan Lo, Richard Mycroft, Guillem Perarnau, Andrew Treglown
Preface. BCC (2019)
Robert Hancock, Katherine Staden, Andrew Treglown
Independent Sets in Hypergraphs and Ramsey Properties of Graphs and the Integers. SIAM J. Discret. Math. 33 (1) (2019)
Joseph Hyde, Hong Liu, Andrew Treglown
A Degree Sequence Komlós Theorem. SIAM J. Discret. Math. 33 (4) (2019)
József Balogh, Andrew Treglown, Zsolt Adam Wagner
Tilings in Randomly Perturbed Dense Graphs. Comb. Probab. Comput. 28 (2) (2019)
Kitty Meeks, Andrew Treglown
On the complexity of finding and counting solution-free sets of integers. Discret. Appl. Math. 243 (2018)
Katherine Staden, Andrew Treglown
On Degree Sequences Forcing The Square of a Hamilton Cycle. SIAM J. Discret. Math. 31 (1) (2017)
Jie Han, Allan Lo, Andrew Treglown, Yi Zhao
Exact Minimum Codegree Threshold for K - 4-Factors. Comb. Probab. Comput. 26 (6) (2017)
Robert Hancock, Andrew Treglown
On solution-free sets of integers. Eur. J. Comb. 66 (2017)
Kitty Meeks, Andrew Treglown
On the complexity of finding and counting solution-free sets of integers. CoRR (2017)
Andrew Treglown
A degree sequence Hajnal-Szemerédi theorem. J. Comb. Theory, Ser. B 118 (2016)
Andrew Treglown, Yi Zhao
A Note on Perfect Matchings in Uniform Hypergraphs. Electron. J. Comb. 23 (1) (2016)
Robert Hancock, Andrew Treglown
Enumerating solution-free sets in the integers. Electron. Notes Discret. Math. 56 (2016)
József Balogh, Andrew Treglown, Zsolt Adam Wagner
Applications of graph containers in the Boolean lattice. Random Struct. Algorithms 49 (4) (2016)
Andrew Treglown
On Directed Versions of the Hajnal-Szemerédi Theorem. Comb. Probab. Comput. 24 (6) (2015)
József Balogh, Hong Liu, Maryam Sharifzadeh, Andrew Treglown
A sharp bound on the number of maximal sum-free sets. Electron. Notes Discret. Math. 49 (2015)
Katherine Staden, Andrew Treglown
On a degree sequence analogue of Pósa's conjecture. Electron. Notes Discret. Math. 49 (2015)
József Balogh, Richard Mycroft, Andrew Treglown
A random version of Sperner's theorem. J. Comb. Theory, Ser. A 128 (2014)
Daniela Kühn, Deryk Osthus, Andrew Treglown
Matchings in 3-uniform hypergraphs. J. Comb. Theory, Ser. B 103 (2) (2013)
Fiachra Knox, Andrew Treglown
Embedding Spanning Bipartite Graphs of Small Bandwidth. Comb. Probab. Comput. 22 (1) (2013)
József Balogh, Alexandr V. Kostochka, Andrew Treglown
On Perfect Packings in Dense Graphs. Electron. J. Comb. 20 (1) (2013)
Andrew Treglown, Yi Zhao
Exact minimum degree thresholds for perfect matchings in uniform hypergraphs II. J. Comb. Theory, Ser. A 120 (7) (2013)
James Cummings, Daniel Král', Florian Pfender, Konrad Sperfeld, Andrew Treglown, Michael Young
Monochromatic triangles in three-coloured graphs. J. Comb. Theory, Ser. B 103 (4) (2013)
Andrew Treglown
A note on some embedding problems for oriented graphs. J. Graph Theory 69 (3) (2012)
Andrew Treglown, Yi Zhao
Exact minimum degree thresholds for perfect matchings in uniform hypergraphs. J. Comb. Theory, Ser. A 119 (7) (2012)
Andrew Treglown, Daniela Kühn, Deryk Osthus
Matchings in 3-uniform hypergraphs of large minimum vertex degree. Electron. Notes Discret. Math. 38 (2011)
Daniela Kühn, Deryk Osthus, Andrew Treglown
Hamiltonian degree sequences in digraphs. J. Comb. Theory, Ser. B 100 (4) (2010)
Daniela Kühn, Deryk Osthus, Andrew Treglown
Degree sequences forcing Hamilton cycles in directed graphs. Electron. Notes Discret. Math. 34 (2009)
Daniela Kühn, Deryk Osthus, Andrew Treglown
An Ore-type Theorem for Perfect Packings in Graphs. SIAM J. Discret. Math. 23 (3) (2009)