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 any graph of minimum degree at least  k , and let  G   p   be the random subgraph of  G  obtained by keeping each edge independently with probability  p . Recently, Krivelevich, Lee and Sudakov showed that if  pk  →  ∞  then with probability tending to 1  G   p   contains a cycle of length at least (1 –  o (1)) k . We give a much shorter proof of this result, also based on depth‐first search. © 2014 Wiley Periodicals, Inc. Random Struct. Alg., 45, 764–767, 2014

Long cycles in random subgraphs of graphs with large minimum degree