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

Fix a graph $G$ in which every edge is colored in some of $k\ge 2$ colors.Two vertices $u$ and $v$ are CA-connected if $u$ and $v$ may be connected usingany subset of $k - 1$ colors. CA-connectivity is an equivalence relationdividing the vertex set into classes called CA-components.  In two recent papers, R\'ath, Varga, Fekete, and Molontay, and Lichev andSchapira studied the size of the largest CA-component in a randomly coloredrandom graph. The second of these works distinguished and studied three regimes(supercritical, intermediate, and subcritical) in which the largestCA-component has respectively linear, logarithmic, and bounded size. In thisshort note, we describe the phase transition between the intermediate and thesubcritical regime.

Color-avoiding percolation of random graphs: between the subcritical and the intermediate regime