Showing math.COShow all
3 papers · 1 filter
math.CO2026
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…
math.CO2026
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…
math.CO2020
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…