7 papers
The inverse problem for the Steiner-Wiener index of trees
Adrian Beker, Rudi Mrazović
For a connected graph and a set , the Steiner distance is the minimum number of edges in a connected subgraph of containing . The Steiner-Wiener…
A note on the shortest law for the symmetric group
Adrian Beker, Luka Milićević, Rudi Mrazović
Let denote the length of the shortest non-trivial two-variable law for the symmetric group . Buskin's quantitative subgroup-separability argument gives the classical lo…
The Erdős--Moser sum-free set problem via improved bounds for -configurations
Adrian Beker
A -configuration is a collection of distinct integers together with their pairwise arithmetic means for . Building…
Improved bounds for skew corner-free sets
Adrian Beker
We construct skew corner-free subsets of of size , thereby improving on recent bounds of the form obtained by Pohoata and Zakharov.…
On a problem of Erdős and Graham about consecutive sums in strictly increasing sequences
Adrian Beker
We show the existence of a constant such that, for all positive integers , there exist integers such that there are at least di…
A protrusive ordering of 5 points not witnessed by any finite multiset
Adrian Beker
Given a finite set of points , we say that an ordering of is protrusive if every point lies outside the convex hull of the points preceding it. We giv…
The star avoidance game
Adrian Beker
Let be positive integers. The -star avoidance game on is played as follows. Two players take it in turn to claim a (previously unclaimed) edge of the complete g…