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

Given an edge-colored complete graph $K_n$ on $n$ vertices, a perfect(respectively, near-perfect) matching $M$ in $K_n$ with an even (respectively,odd) number of vertices is rainbow if all edges have distinct colors. In thispaper, we consider an edge coloring of $K_n$ by circular distance, and wedenote the resulting complete graph by $K^{\bullet}_n$. We show that when$K^{\bullet}_n$ has an even number of vertices, it contains a rainbow perfectmatching if and only if $n=8k$ or $n=8k+2$, where $k$ is a nonnegative integer.In the case of an odd number of vertices, Kirkman matching is known to be arainbow near-perfect matching in $K^{\bullet}_n$. However, real-worldapplications sometimes require multiple rainbow near-perfect matchings. Wepropose a method for using a recursive algorithm to generate multiple rainbownear-perfect matchings in $K^{\bullet}_n$.

Rainbow Perfect and Near-Perfect Matchings in Complete Graphs with Edges Colored by Circular Distance