24 citations · 153 across the 39 of their papers we have counts for
4 papers · 1 filter
Tilings in randomly perturbed dense graphs
József Balogh, Andrew Treglown, Adam Zsolt Wagner
A perfect -tiling in a graph is a collection of vertex-disjoint copies of a graph in that together cover all the vertices in . In this paper we investigate perfec…
On the complexity of finding and counting solution-free sets of integers
Kitty Meeks, Andrew Treglown
Given a linear equation , a set of integers is -free if does not contain any `non-trivial' solutions to . This notion incorporates ma…
An improved lower bound for Folkman's theorem
József Balogh, Sean Eberhard, Bhargav Narayanan +2
Folkman's Theorem asserts that for each , there exists a natural number such that whenever the elements of are two-coloured, there exists a set $…
Independent sets in hypergraphs and Ramsey properties of graphs and the integers
Robert Hancock, Katherine Staden, Andrew Treglown
Many important problems in combinatorics and other related areas can be phrased in the language of independent sets in hypergraphs. Recently Balogh, Morris and Samotij, and indepen…