Powers of Hamilton cycles in dense graphs perturbed by a random geometric graph

Abstract: Let

G

be a graph obtained as the union of some

n

-vertex graph

H_{n}

with minimum degree

d e l t a (H_{n}) g e q a l p h a n

and a

d

-dimensional random geometric graph

G^{d} (n, r)

. We investigate under which conditions for

r

the graph

G

will a.a.s. contain the

k

-th power of a Hamilton cycle, for any choice of

H_{n}

. We provide asymptotically optimal conditions for

r

for all values of

a l p h a

,

d

and

k

. This has applications in the containment of other spanning structures, such as

F

-factors.

This page was built for publication: Powers of Hamilton cycles in dense graphs perturbed by a random geometric graph