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 a graph on $n$ vertices and let $k$ be a fixed positive integer.We denote by $\mathcal G_{\text{$k$-out}}(G)$ the probability space consistingof subgraphs of $G$ where each vertex $v\in V(G)$ randomly picks $k$ neighborsfrom $G$, independently from all other vertices. We show that if$\delta(G)=\omega(\log n)$ and $k\geq 2$, then the following holds for every$p=\omega(\log n/\delta(G))$. Let $H$ be a random graph obtained by keepingeach $e\in E(G)$ with probability $p$ independently at random and then coloringits edges independently and uniformly at random with elements from the set$[kn]$. Then, w.h.p. $H$ contains $t:=(1-o(1))\delta(G)p/(2k)$ edge-disjointgraphs $H_1,...,H_t$ such that each of the $H_i$ is \emph{rainbow} (that is,all the edges are colored with distinct colors), and such that for everymonotone increasing property of graphs $\mathcal P$ and for every $1\leq i\leqt$ we have $\Pr[\mathcal G_{\text{$k$-out}}(G)\models \mathcal P]\leq\Pr[H_i\models \mathcal P]+n^{-\omega(1)}$. Note that since (in this case) atypical member of $\mathcal G_{\text{$k$-out}}(G)$ has average degree roughly$2k$, this result is asymptotically best possible. We present severalapplications of this; for example, we use this result to prove that for$p=\omega(\log n/n)$ and $c=23n$, a graph $H\sim \mathcal G_{c}(K_n,p)$ w.h.p.contains $(1-o(1))np/46$ edge-disjoint rainbow Hamilton cycles. More generally,using a recent result of Frieze and Johansson, the same method allows us toprove that if $G$ has minimum degree $\delta(G)\geq (1+\varepsilon)n/2$, thenthere exist functions $c=O(n)$ and $t=\Theta(np)$ (depending on $\varepsilon$)such that the random subgraph $H\sim \mathcal G_{c}(G,p)$ w.h.p. contains $t$edge-disjoint rainbow Hamilton cycles.

Packing a randomly edge-colored random graph with rainbow $k$-outs