F. Clemen

activity

20242026

collaborators

10 papers

math.CO2026

Triangle-Saturated Graphs in the Semi-Random Graph Process

Felix Christian Clemen, Pawel Pralat

The semi-random graph process is an adaptive random graph process in which an online algorithm is initially given an empty graph on $n$ vertices. In each round, a vertex $u$ is pre…

math.CO2026

A minimum-degree threshold for colour-biased Hamilton cycles in hypergraphs

Natalie Behague, Felix Christian Clemen, Joseph Hyde +1

We determine the asymptotically best possible minimum vertex degree condition forcing a two-coloured $3$ -graph to contain a colour-biased tight Hamilton cycle. This confirms a conj…

math.CO2026

The number of regular simplices in higher dimensions

Felix Christian Clemen, Adrian Dumitrescu, Dingyuan Liu

We study the extremal function $S_{d}^{k} (n)$ , defined as the maximum number of regular $(k - 1)$ -simplices spanned by $n$ points in $R^{d}$ . For any fixed $d \geq 2 k \geq 6$ , we dete…

math.CO2026

Geometric Sidon Problems

Felix Christian Clemen, Jakob FÃ¼hrer, Oliver Roche-Newton

This paper considers geometric problems of the following type: given a point set $P \subset R^{2}$ , one seeks a large subset avoiding a prescribed geometric configuration. Ou…

math.CO2026

On Tournament Anti-Sidorenko Orientations of Trees

Hao Chen, Felix Christian Clemen, Jonathan A. Noel

An oriented graph $H$ is said to be tournament anti-Sidorenko if the homomorphism density of $H$ in any tournament $T$ is bounded above by the homomorphism densit…

math.CO2026

On multiplicities of interpoint distances

Felix Christian Clemen, Adrian Dumitrescu, Dingyuan Liu

Given a set $X \subseteq R^{2}$ of $n$ points and a distance $d > 0$ , the multiplicity of $d$ is the number of times the distance $d$ appears between points in $X$ . Let $a_1(X)…