Clara Shikhelman

most citedPacking a randomly edge-colored random graph with rainbow

k

-outs

8 citations · 8 across the 2 of their papers we have counts for

collaborators

2 papers

math.CO2014★ 8 cited

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

Asaf Ferber, Gal Kronenberg, Frank Mousset +1

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 consisting of subgraphs of $G$ where…

math.CO2014

Many $T$ copies in $H$ -free graphs

Noga Alon, Clara Shikhelman

For two graphs $T$ and $H$ with no isolated vertices and for an integer $n$ , let $e x (n, T, H)$ denote the maximum possible number of copies of $T$ in an $H$ -free graph on $n$ vertice…

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

Many T copies in H-free graphs

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

Many $T$ copies in $H$ -free graphs