T. Tan

activity

20102024

most citedThe Brush Number of the Two-Dimensional Torus

5 citations · 5 across the 7 of their papers we have counts for

collaborators

Showing 2017Show all

2 papers · 1 filter

math.CO2017

Improved Bounds for the Graham-Pollak Problem for Hypergraphs

Imre Leader, Ta Sheng Tan

For a fixed $r$ , let $f_{r} (n)$ denote the minimum number of complete $r$ -partite $r$ -graphs needed to partition the complete $r$ -graph on $n$ vertices. The Graham-Pollak theorem ass…

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…

Improved Bounds for the Graham-Pollak Problem for Hypergraphs

Decomposing the Complete r-Graph

Decomposing the Complete $r$ -Graph