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

We prove that there exists a function $f(k)=\mathcal{O}(k^2 \log k)$ suchthat for every $C_4$-free graph $G$ and every $k \in \mathbb{N}$, $G$ eithercontains $k$ vertex-disjoint holes of length at least $6$, or a set $X$ of atmost $f(k)$ vertices such that $G-X$ has no hole of length at least $6$. Thisanswers a question of Kim and Kwon [Erd\H{o}s-P\'osa property of chordlesscycles and its applications. JCTB 2020].

On the Erd\H{o}s-P\'osa property for long holes in $C_4$-free graphs