Adrian Beker

collaborators

2 papers

math.NT2025

The Erdős--Moser sum-free set problem via improved bounds for $k$ -configurations

Adrian Beker

A $k$ -configuration is a collection of $k$ distinct integers $x_{1}, \dots, x_{k}$ together with their pairwise arithmetic means $\frac{x _{i} + x _{j}}{2}$ for $1 \leq i < j \leq k$ . Building…

math.CO2020

The star avoidance game

Adrian Beker

Let $n, k$ be positive integers. The $(k + 1)$ -star avoidance game on $K_{n}$ is played as follows. Two players take it in turn to claim a (previously unclaimed) edge of the complete g…

The Erdős--Moser sum-free set problem via improved bounds for k-configurations

The star avoidance game

The Erdős--Moser sum-free set problem via improved bounds for $k$ -configurations