10 citations · 12 across the 7 of their papers we have counts for
12 papers
Proof of the Kohayakawa--Kreuter conjecture for the majority of cases
Candida Bowtell, Robert Hancock, Joseph Hyde
For graphs , write to denote the property that whenever we -colour the edges of , there is a monochromatic copy of in colou…
Immersions of directed graphs in tournaments
António Girão, Robert Hancock
Recently, Draganić, Munhá Correia, Sudakov and Yuster showed that every tournament on vertices contains a -subdivision of a transitive tournament on vertices,…
Two Ramsey problems in blowups of graphs
António Girão, Robert Hancock
Given graphs and , we say if every -colouring of the edges of contains a monochromatic copy of . Let denote the -blowup of . T…
Rectilinear approximation and volume estimates for hereditary bodies via [0,1]-decorated containers
Victor Falgas-Ravry, Robert Hancock, Johanna Strömberg +1
We use the hypergraph container theory of Balogh--Morris--Samotij and Saxton--Thomason to obtain general rectilinear approximations and volume estimates for sequences of bodies clo…
Limits of Latin squares
Frederik Garbe, Robert Hancock, Jan Hladký +1
We develop a limit theory of Latin squares, paralleling the recent limit theories of dense graphs and permutations. We introduce a notion of density, an appropriate version of the…
An asymmetric random Rado theorem for single equations: the -statement
Robert Hancock, Andrew Treglown
A famous result of Rado characterises those integer matrices which are partition regular, i.e. for which any finite colouring of the positive integers gives rise to a monochrom…
Coloring graphs by translates in the circle
Pablo Candela, Carlos Catala, Robert Hancock +4
The fractional and circular chromatic numbers are the two most studied non-integral refinements of the chromatic number of a graph. Starting from the definition of a coloring base…
No additional tournaments are quasirandom-forcing
Robert Hancock, Adam Kabela, Daniel Kral +4
A tournament H is quasirandom-forcing if the following holds for every sequence (G_n) of tournaments of growing orders: if the density of H in G_n converges to the expected density…
Long paths and connectivity in {}-independent random graphs
A. Nicholas Day, Victor Falgas-Ravry, Robert Hancock
Given a graph , a probability measure on the subsets of the edge set of is said to be -independent if events determined by edge sets that are at graph distance at lea…
The Maker-Breaker Rado game on a random set of integers
Robert Hancock
Given an integer-valued matrix of dimension and an integer-valued vector of dimension , the Maker-Breaker -game on a set of integers is the…
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…
On solution-free sets of integers II
Robert Hancock, Andrew Treglown
Given a linear equation , a set is -free if does not contain any `non-trivial' solutions to . We determine the precise…