Shoni Gilboa

activity

20132025

most citedHow many queries are needed to distinguish a truncated random permutation from a random function?

17 citations · 82 across the 18 of their papers we have counts for

collaborators

Showing 2013Show all

3 papers · 1 filter

math.CO2013★ 1 cited

On the Union of Arithmetic Progressions

Shoni Gilboa, Rom Pinchasi

We show that for every $ε > 0$ there is an absolute constant $c (ε) > 0$ such that the following is true. The union of any $n$ arithmetic progressions, each of lengt…

math.CO2013★ 15 cited

Anti-Ramsey numbers of graphs with small connected components

Shoni Gilboa, Yehuda Roditty

The anti-Ramsey number, $A R (n, G)$ , for a graph $G$ and an integer $n \geq ∣ V (G) ∣$ , is defined to be the minimal integer $r$ such that in any edge-colouring of $K_{n}$ by at least $r$ c…

math.CO2013★ 13 cited

Anti-Ramsey numbers of small graphs

Arie Bialostocki, Shoni Gilboa, Yehuda Roditty

The anti-Ramsey number $A R (n, G$ ), for a graph $G$ and an integer $n \geq ∣ V (G) ∣$ , is defined to be the minimal integer $r$ such that in any edge-colouring of $K_{n}$ by at least $r$ co…