Luka Milićević

collaborators

2 papers

math.CO2017

Small Sets with Large Difference Sets

Luka Milicevic

For every $ε > 0$ and $k \in N$ , Haight constructed a set $A \subset Z_{N}$ ( $Z_{N}$ stands for the integers modulo $N$ ) for a suitable $N$ , such that $A-A =…

math.CO2017

Decomposing the Complete $r$ -Graph

Imre Leader, Luka Milićević, Ta Sheng Tan

Let $f_{r} (n)$ be the minimum number of complete $r$ -partite $r$ -graphs needed to partition the edge set of the complete $r$ -uniform hypergraph on $n$ vertices. Graham and Pollak sho…

Small Sets with Large Difference Sets

Decomposing the Complete r-Graph

Decomposing the Complete $r$ -Graph