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

Let $G$ be a graph of order $n$, and let $a,b$ and $k$ nonnegative integers with $2\leq a\leq b$. A graph $G$ is called all fractional $(a,b,k)$-critical if after deleting any $k$ vertices of $G$ the remaining graph of $G$ has all fractional $[a,b]$-factors. In this paper, it is proved that $G$ is all fractional $(a,b,k)$-critical if $n\geq\frac{(a+b-1)(a+b-3)+a}{a}+\frac{ak}{a-1}$ and $bind(G)>\frac{(a+b-1)(n-1)}{an-ak-(a+b)+2}$. Furthermore, it is shown that this result is best possible in some sense.

Binding numbers for all fractional (a, b, k)-critical graphs