104 citations · 132 across the 9 of their papers we have counts for
Showing 2017Show all
3 papers · 1 filter
math.CO2017
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…
math.CO2017
Families in posets minimizing the number of comparable pairs
Jozsef Balogh, Sarka Petrickova, Adam Zsolt Wagner
Given a poset we say a family is centered if it is obtained by `taking sets as close to the middle layer as possible'. A poset is said to have the…
math.CO2017★ 2 cited
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 $…