Dawid Ignasiak

collaborators

2 papers

math.CO2025

Sharp thresholds, hitting times and the power of choice for random geometric graphs

Dawid Ignasiak, Lyuben Lichev

We consider a random geometric graph process where random points $(X_{i})_{i \geq 1}$ are embedded consecutively in the $d$ -dimensional unit torus $T^{d}$ , and every two points…

math.CO2025

Spanning trees of bounded degree in random geometric graphs

Michael Anastos, Sahar Diskin, Dawid Ignasiak +2

We determine the sharp threshold for the containment of all $n$ -vertex trees of bounded degree in random geometric graphs with $n$ vertices. This provides a geometric counterpart o…