Richard Ueltzen

collaborators

2 papers

math.CO2026

On efficient graph covers and steered random walks

Nathan Tung, Richard Ueltzen

We prove that the vertices of any $n$ -vertex graph can be partitioned into pieces of radius $r = O (lo g n)$ such that the sum of the sizes of their closed neighborhoods is at most…

math.CO2024

Characterizing graphs with high inducibility

Richard Ueltzen

For a positive integer $k$ and a graph $H$ on $k$ vertices, we are interested in the inducibility of $H$ , denoted $ind (H)$ , which is defined as the maximum possible probab…