T. Gowers

collaborators

3 papers

math.CO2019

Partial associativity and rough approximate groups

W. T. Gowers, Jason Long

Suppose that a binary operation $\circ$ on a finite set $X$ is injective in each variable separately and also associative. It is easy to prove that $(X, \circ)$ must be a group. In…

math.CO2018

Subsets of Cayley graphs that induce many edges

W. T. Gowers, O. Janzer

Let $G$ be a regular graph of degree $d$ and let $A \subset V (G)$ . Say that $A$ is $η$ -closed if the average degree of the subgraph induced by $A$ is at least $η d$ . This says that i…

math.CO2018

Improved bounds for the Erdős-Rogers function

W. T. Gowers, O. Janzer

The Erdős-Rogers function $f_{s, t}$ measures how large a $K_{s}$ -free induced subgraph there must be in a $K_{t}$ -free graph on $n$ vertices. While good estimates for $f_{s, t}$ are kno…