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

The conjecture, still widely open, posed by Marco Buratti, Peter Horak andAlex Rosa states that a list $L$ of $v-1$ positive integers not exceeding$\left\lfloor \frac{v}{2}\right\rfloor$ is the list of edge-lengths of asuitable Hamiltonian path of the complete graph with vertex-set$\{0,1,\ldots,v-1\}$ if and only if, for every divisor $d$ of $v$, the numberof multiples of $d$ appearing in $L$ is at most $v-d$. In this paper we presentnew methods that are based on linear realizations and can be applied to provethe validity of this conjecture for a vast choice of lists. As example of theirflexibility, we consider lists whose underlying set is one of the following:$\{x,y,x+y\}$, $\{1,2,3,4\}$, $\{1,2,4,\ldots,2x\}$,$\{1,2,4,\ldots,2x,2x+1\}$. We also consider lists with many consecutiveelements.

New methods to attack the Buratti-Horak-Rosa conjecture