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

An $r$-graph $G$ is a pair $(V,E)$ such that $V$ is a set and $E$ is a familyof $r$-element subsets of $V$. The \emph{independence number} $\alpha(G)$ of$G$ is the size of a largest subset $I$ of $V$ such that no member of $E$ is asubset of $I$. The \emph{transversal number} $\tau(G)$ of $G$ is the size of asmallest subset $T$ of $V$ that intersects each member of $E$. $G$ is said tobe \emph{connected} if for every distinct $v$ and $w$ in $V$ there exists a\emph{path} from $v$ to $w$ (that is, a sequence $e_1, \dots, e_p$ of membersof $E$ such that $v \in e_1$, $w \in e_p$, and if $p \geq 2$, then for each $i\in \{1, \dots, p-1\}$, $e_i$ intersects $e_{i+1}$). The \emph{degree} of amember $v$ of $V$ is the number of members of $E$ that contain $v$. The maximumof the degrees of the members of $V$ is denoted by $\Delta(G)$. We show thatfor any $1 \leq k < n$, if $G = (V,E)$ is a connected $r$-graph, $|V| = n$, and$\Delta(G) = k$, then \[\alpha(G) \leq n - \left \lceil \frac{n-1}{k(r-1)}\right \rceil, \quad \tau(G) \geq \left \lceil \frac{n-1}{k(r-1)} \right\rceil,\] and these bounds are sharp. The two bounds are equivalent.

A sharp upper bound for the independence number