According to our database
1,
Andrew Treglown
authored at least 44 papers
between 2009 and 2024.
Collaborative distances:
-
Dijkstra number2 of
four.
-
Erdős number3 of
two.
2024
On oriented cycles in randomly perturbed digraphs.
Comb. Probab. Comput., March, 2024
On Some Extremal and Probabilistic Questions for Tree Posets.
Electron. J. Comb., 2024
2022
An asymmetric random Rado theorem for single equations: The 0-statement.
Random Struct. Algorithms, 2022
Extremal problems for multigraphs.
J. Comb. Theory, Ser. B, 2022
Tilings in vertex ordered graphs.
J. Comb. Theory, Ser. B, 2022
Complete subgraphs in a multipartite graph.
Comb. Probab. Comput., 2022
On deficiency problems for graphs.
Comb. Probab. Comput., 2022
On Maximal Sum-Free Sets in Abelian Groups.
Electron. J. Comb., 2022
2021
A Note on Color-Bias Hamilton Cycles in Dense Graphs.
SIAM J. Discret. Math., 2021
Transitive Tournament Tilings in Oriented Graphs with Large Minimum Total Degree.
SIAM J. Discret. Math., 2021
Tilings in randomly perturbed graphs: Bridging the gap between Hajnal-Szemerédi and Johansson-Kahn-Vu.
Random Struct. Algorithms, 2021
A discrepancy version of the Hajnal-Szemerédi theorem.
Comb. Probab. Comput., 2021
2020
Existence thresholds and Ramsey properties of random posets.
Random Struct. Algorithms, 2020
Vertex Ramsey properties of randomly perturbed graphs.
Random Struct. Algorithms, 2020
The complexity of perfect matchings and packings in dense hypergraphs.
J. Comb. Theory, Ser. B, 2020
Ramsey properties of randomly perturbed graphs: cliques and cycles.
Comb. Probab. Comput., 2020
A Degree Sequence Version of the Kühn-Osthus Tiling Theorem.
Electron. J. Comb., 2020
2019
A Degree Sequence Komlós Theorem.
SIAM J. Discret. Math., 2019
Independent Sets in Hypergraphs and Ramsey Properties of Graphs and the Integers.
SIAM J. Discret. Math., 2019
Tilings in Randomly Perturbed Dense Graphs.
Comb. Probab. Comput., 2019
Proceedings of the Surveys in Combinatorics, 2019: Invited lectures from the 27th British Combinatorial Conference, Birmingham, UK, July 29, 2019
2018
On the complexity of finding and counting solution-free sets of integers.
Discret. Appl. Math., 2018
2017
On Degree Sequences Forcing The Square of a Hamilton Cycle.
SIAM J. Discret. Math., 2017
On solution-free sets of integers.
Eur. J. Comb., 2017
Exact Minimum Codegree Threshold for K - 4-Factors.
Comb. Probab. Comput., 2017
2016
Applications of graph containers in the Boolean lattice.
Random Struct. Algorithms, 2016
A degree sequence Hajnal-Szemerédi theorem.
J. Comb. Theory, Ser. B, 2016
Enumerating solution-free sets in the integers.
Electron. Notes Discret. Math., 2016
A Note on Perfect Matchings in Uniform Hypergraphs.
Electron. J. Comb., 2016
2015
On a degree sequence analogue of Pósa's conjecture.
Electron. Notes Discret. Math., 2015
A sharp bound on the number of maximal sum-free sets.
Electron. Notes Discret. Math., 2015
On Directed Versions of the Hajnal-Szemerédi Theorem.
Comb. Probab. Comput., 2015
2014
A random version of Sperner's theorem.
J. Comb. Theory, Ser. A, 2014
2013
Exact minimum degree thresholds for perfect matchings in uniform hypergraphs II.
J. Comb. Theory, Ser. A, 2013
Matchings in 3-uniform hypergraphs.
J. Comb. Theory, Ser. B, 2013
Monochromatic triangles in three-coloured graphs.
J. Comb. Theory, Ser. B, 2013
Embedding Spanning Bipartite Graphs of Small Bandwidth.
Comb. Probab. Comput., 2013
On Perfect Packings in Dense Graphs.
Electron. J. Comb., 2013
2012
A note on some embedding problems for oriented graphs.
J. Graph Theory, 2012
Exact minimum degree thresholds for perfect matchings in uniform hypergraphs.
J. Comb. Theory, Ser. A, 2012
2011
Matchings in 3-uniform hypergraphs of large minimum vertex degree.
Electron. Notes Discret. Math., 2011
2010
Hamiltonian degree sequences in digraphs.
J. Comb. Theory, Ser. B, 2010
2009
An Ore-type Theorem for Perfect Packings in Graphs.
SIAM J. Discret. Math., 2009
Degree sequences forcing Hamilton cycles in directed graphs.
Electron. Notes Discret. Math., 2009
