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

In 1974, Kundu showed that for even $n$ if $\pi=(d_{1},\ldots,d_{n})$ is anon-increasing degree sequence such that$\mathcal{D}_{k}(\pi)=(d_{1}-k,\ldots,d_{n}-k)$ is graphic, then somerealization of $\pi$ has a $k$-factor. In 1978, Brualdi and then Busch et al.\in 2012, conjectured that not only is there a $k$-factor, but there is$k$-factor that can be partitioned into $k$ edge-disjoint $1$-factors. Busch etal.\ showed that if $k\leq 3$, $d_{1}\leq \frac{n}{2}+1$, or $d_{n}\geq\frac{n}{2}+k-2$, then the conjecture holds. Later, Seacrest extended this to$k\leq 5$. We explore this conjecture by first developing new tools thatgeneralize edge-exchanges. With these new tools, we can drop the assumption$\mathcal{D}_{k}(\pi)$ is graphic and show that if $d_{d_{1}-d_{n}+k}\geqd_{1}-d_{n}+k-1$, then $\pi$ has a realization with $k$ edge-disjoint$1$-factors. From this we show that if $d_{n}\geq \frac{d_{1}+k-1}{2}$ or$\mathcal{D}_{k}(\pi)$ is graphic and $d_{1}\leq \max\{n/2+d_{n}-k,(n+d_{n})/2\}$, then the conjecture holds. With a differentapproach we show the conjecture holds when $\mathcal{D}_{k}(\pi)$ is graphicand $d_{\min\{\frac{n}{2},m(\pi)-1\}}> \big\lceil\frac{n+3k-8}{2}\big\rceil$where $m(\pi)=\max\{i : d_{i}\geq i-1\}$. For $r\leq 2$, Busch et al.\ andlater Seacrest for $r\leq 4$ showed that if $\mathcal{D}_{k}(\pi)$ is graphic,then there is a realization with a $k$-factor whose edges can be partitionedinto a $(k-r)$-factor and $r$ edge-disjoint $1$-factors. We improve this forany $r\leq \max\big\{\min\{k,4\},\frac{k+3}{3}\big\}$. As a result, we can showthat if $\mathcal{D}_{k}(\pi)$ is graphic, then there is a realization with atleast $2\big\lfloor \frac{k}{3}\big\rfloor$ edge-disjoint $1$-factors.

On a conjecture that strengthens the $k$-factor case of Kundu's $k$-factor Theorem