5 citations · 5 across the 3 of their papers we have counts for
4 papers
Improved Bounds for the Graham-Pollak Problem for Hypergraphs
Imre Leader, Ta Sheng Tan
For a fixed , let denote the minimum number of complete -partite -graphs needed to partition the complete -graph on vertices. The Graham-Pollak theorem ass…
Decomposing the Complete -Graph
Imre Leader, Luka Milićević, Ta Sheng Tan
Let be the minimum number of complete -partite -graphs needed to partition the edge set of the complete -uniform hypergraph on vertices. Graham and Pollak sho…
A note on large rainbow matchings in edge-coloured graphs
Allan Lo, Ta Sheng Tan
A rainbow subgraph in an edge-coloured graph is a subgraph such that its edges have distinct colours. The minimum colour degree of a graph is the smallest number of distinct colour…
The Brush Number of the Two-Dimensional Torus
Ta Sheng Tan
In this paper we are interested in the brush number of a graph - a concept introduced by McKeil and by Messinger, Nowakowski and Pralat. Our main aim in this paper is to determine…