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 Tools annual

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 Tools monthly

Global: Zendy Plus monthly

Presents the access of premium content as premium feature

Premium Content

Global: Zendy Plus annual

Global: Zendy Free Plan

Given two graphs $G$ and $H$, the {\it rainbow number} $rb(G,H)$ for $H$ withrespect to $G$ is defined as the minimum number $k$ such that any$k$-edge-coloring of $G$ contains a rainbow $H$, i.e., a copy of $H$, all ofits edges have different colors. Denote by $M_t$ a matching of size $t$ and$\mathcal {T}_n$ the class of all plane triangulations of order $n$,respectively. Jendrol', Schiermeyer and Tu initiated to investigate the rainbownumbers for matchings in plane triangulations, and proved some bounds for thevalue of $rb({\mathcal {T}_n},M_t)$. Chen, Lan and Song proved that $2n+3t-14\le rb(\mathcal {T}_n, M_t)\le 2n+4t-13$ for all $n\ge 3t-6$ and $t \ge 6$. Inthis paper, we determine the exact values of $rb({\mathcal {T}_n},M_t)$ forlarge $n$, namely, $rb({\mathcal {T}_n},M_t)=2n+3t-14$ for all $n \ge 9t+3$ and$t\ge 7$.

Exact rainbow numbers for matchings in plane triangulations