Paul Horn

collaborators

3 papers

math.CO2026

Subsequence sums in permutations

Collier Gaiser, Paul Horn

A sequence of positive integers $(a_{1}, a_{2}, \dots, a_{k})$ is called $ℓ$ -additive if $a_{1} + a_{2} + \dots + a_{k} = ℓ a_{1}$ or $ℓ a_{k}$ . In this paper, we prove that for all $k \geq 3$ , if $…

math.CO2026

On fixing and distinguishing numbers of trees

Calum Buchanan, Peter Dankelmann, Isabel Harris +3

A graph $G$ is $D$ -distinguishable if there is a labeling of its vertices with $D$ labels such that the only automorphism of $G$ which preserves the labeling is the identity. The d…

math.CO2026

Improving $R (3, k)$ in just two bites

Zion Hefty, Paul Horn, Dylan King +1

We present a flexible random construction which, for certain graphs $H$ , is able to produce $H$ -free graphs with edge density strictly larger than that of the $H$ -free process, whi…

Subsequence sums in permutations

On fixing and distinguishing numbers of trees

Improving R(3,k) in just two bites

Improving $R (3, k)$ in just two bites