English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

We study the appearance of powers of Hamilton cycles in pseudorandom graphs,using the following comparatively weak pseudorandomness notion. A graph $G$ is$(\varepsilon,p,k,\ell)$-pseudorandom if for all disjoint $X$ and $Y\subsetV(G)$ with $|X|\ge\varepsilon p^kn$ and $|Y|\ge\varepsilon p^\ell n$ we have$e(X,Y)=(1\pm\varepsilon)p|X||Y|$. We prove that for all $\beta>0$ there is an$\varepsilon>0$ such that an $(\varepsilon,p,1,2)$-pseudorandom graph on $n$vertices with minimum degree at least $\beta pn$ contains the square of aHamilton cycle. In particular, this implies that $(n,d,\lambda)$-graphs with$\lambda\ll d^{5/2 }n^{-3/2}$ contain the square of a Hamilton cycle, and thusa triangle factor if $n$ is a multiple of $3$. This improves on a result ofKrivelevich, Sudakov and Szab\'o [Triangle factors in sparse pseudo-randomgraphs, Combinatorica 24 (2004), no. 3, 403--426].  We also extend our result to higher powers of Hamilton cycles and establishcorresponding counting versions.

Powers of Hamilton cycles in pseudorandom graphs