Andrew Treglown

Camila Zárate-Guerén

SIAM J. Discret. Math., 2024

Tiling Edge-Ordered Graphs with Monotone Paths and Other Structures.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2024

On Some Extremal and Probabilistic Questions for Tree Posets.

[BibT_eX]

[DOI]

Balázs Patkós

Electron. J. Comb., 2024

2023

The induced saturation problem for posets.

[BibT_eX]

[DOI]

Comb. Theory, 2023

2022

An asymmetric random Rado theorem for single equations: The 0-statement.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2022

Extremal problems for multigraphs.

[BibT_eX]

[DOI]

A. Nicholas Day

Victor Falgas-Ravry

J. Comb. Theory B, 2022

Tilings in vertex ordered graphs.

[BibT_eX]

[DOI]

Lina Li

J. Comb. Theory B, 2022

Complete subgraphs in a multipartite graph.

[BibT_eX]

[DOI]

Allan Lo

Comb. Probab. Comput., 2022

On deficiency problems for graphs.

[BibT_eX]

[DOI]

Andrea Freschi

Joseph Hyde

Comb. Probab. Comput., 2022

On Maximal Sum-Free Sets in Abelian Groups.

[BibT_eX]

[DOI]

Nathanaël Hassler

Electron. J. Comb., 2022

2021

A Note on Color-Bias Hamilton Cycles in Dense Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2021

Transitive Tournament Tilings in Oriented Graphs with Large Minimum Total Degree.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2021

Tilings in randomly perturbed graphs: Bridging the gap between Hajnal-Szemerédi and Johansson-Kahn-Vu.

[BibT_eX]

[DOI]

Jie Han

Patrick Morris

Random Struct. Algorithms, 2021

A discrepancy version of the Hajnal-Szemerédi theorem.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2021

2020

Existence thresholds and Ramsey properties of random posets.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2020

Vertex Ramsey properties of randomly perturbed graphs.

[BibT_eX]

[DOI]

Shagnik Das

Patrick Morris

Random Struct. Algorithms, 2020

The complexity of perfect matchings and packings in dense hypergraphs.

[BibT_eX]

[DOI]

Jie Han

J. Comb. Theory B, 2020

Ramsey properties of randomly perturbed graphs: cliques and cycles.

[BibT_eX]

[DOI]

Shagnik Das

Comb. Probab. Comput., 2020

A Degree Sequence Version of the Kühn-Osthus Tiling Theorem.

[BibT_eX]

[DOI]

Joseph Hyde

Electron. J. Comb., 2020

2019

A Degree Sequence Komlós Theorem.

[BibT_eX]

[DOI]

Joseph Hyde

Hong Liu

SIAM J. Discret. Math., 2019

Independent Sets in Hypergraphs and Ramsey Properties of Graphs and the Integers.

[BibT_eX]

[DOI]

Katherine Staden

SIAM J. Discret. Math., 2019

Tilings in Randomly Perturbed Dense Graphs.

[BibT_eX]

[DOI]

Zsolt Adam Wagner

Comb. Probab. Comput., 2019

Preface.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Kitty Meeks

Discret. Appl. Math., 2018

2017

On Degree Sequences Forcing The Square of a Hamilton Cycle.

[BibT_eX]

[DOI]

Katherine Staden

SIAM J. Discret. Math., 2017

On solution-free sets of integers.

[BibT_eX]

[DOI]

Eur. J. Comb., 2017

Exact Minimum Codegree Threshold for K - 4-Factors.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2017

2016

Applications of graph containers in the Boolean lattice.

[BibT_eX]

[DOI]

Zsolt Adam Wagner

Random Struct. Algorithms, 2016

A degree sequence Hajnal-Szemerédi theorem.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2016

Enumerating solution-free sets in the integers.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2016

A Note on Perfect Matchings in Uniform Hypergraphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2016

2015

On a degree sequence analogue of Pósa's conjecture.

[BibT_eX]

[DOI]

Katherine Staden

Electron. Notes Discret. Math., 2015

A sharp bound on the number of maximal sum-free sets.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2015

On Directed Versions of the Hajnal-Szemerédi Theorem.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2015

2014

A random version of Sperner's theorem.

[BibT_eX]

[DOI]

Richard Mycroft

J. Comb. Theory A, 2014

2013

Exact minimum degree thresholds for perfect matchings in uniform hypergraphs II.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2013

Matchings in 3-uniform hypergraphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2013

Monochromatic triangles in three-coloured graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2013

Embedding Spanning Bipartite Graphs of Small Bandwidth.

[BibT_eX]

[DOI]

Fiachra Knox

Comb. Probab. Comput., 2013

On Perfect Packings in Dense Graphs.

[BibT_eX]

[DOI]

Alexandr V. Kostochka

Electron. J. Comb., 2013

2012

A note on some embedding problems for oriented graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2012

Exact minimum degree thresholds for perfect matchings in uniform hypergraphs.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2012

2011

Matchings in 3-uniform hypergraphs of large minimum vertex degree.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2011

2010

Hamiltonian degree sequences in digraphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2010

2009

An Ore-type Theorem for Perfect Packings in Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2009

Degree sequences forcing Hamilton cycles in directed graphs.

[BibT_eX]

[DOI]