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 $M$ be a perfect matching in a graph. A subset $S$ of $M$ is said to be aforcing set of $M$, if $M$ is the only perfect matching in the graph thatcontains $S$. The minimum size of a forcing set of $M$ is called the forcingnumber of $M$. Pachter and Kim [Discrete Math. 190 (1998) 287--294] conjecturedthat the forcing number of every perfect matching in the $n$-dimensionalhypercube is at least $2^{n-2}$, for all $n \ge 2$. Riddle [Discrete Math. 245(2002) 283-292] proved this for even $n$. We show that the conjecture holds forall $n \ge 2$. The proof is based on simple linear algebra.

The minimum forcing number of perfect matchings in the hypercube