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

In this paper, we are concerned with sufficient conditions for the existenceof a $\{P_{2},P_{2k+1}\}$-factor. We prove that for $k\geq 3$, there exists$\varepsilon_{k}>0$ such that if a graph $G$ satisfies $\sum_{0\leq j\leqk-1}c_{2j+1}(G-X)\leq \varepsilon_{k}|X|$ for all $X\subseteq V(G)$, then $G$has a $\{P_{2},P_{2k+1}\}$-factor, where $c_{i}(G-X)$ is the number ofcomponents $C$ of $G-X$ with $|V(C)|=i$. On the other hand, we constructinfinitely many graphs $G$ having no $\{P_{2},P_{2k+1}\}$-factor such that$\sum_{0\leq j\leq k-1}c_{2j+1}(G-X)\leq \frac{32k+141}{72k-78}|X|$ for all$X\subseteq V(G)$.

Sufficient conditions for the existence of a path-factor which are related to odd components