6 citations · 14 across the 15 of their papers we have counts for
17 papers
Odd Covers of Complete Graphs and Hypergraphs
Imre Leader, Ta Sheng Tan
The `odd cover number' of a complete graph is the smallest size of a family of complete bipartite graphs that covers each edge an odd number of times. For odd, Buchanan, Clifto…
The Ramsey numbers for trees of order with maximum degree at least versus the wheel graph of order nine
Zhi Yee Chng, Thomas Britz, Ta Sheng Tan +1
The Ramsey numbers are determined for each tree graph of order and maximum degree equal to either or . These numbers indicate stron…
A Note on Graph Burning of Path Forests
Ta Sheng Tan, Wen Chean Teh
Graph burning is a natural discrete graph algorithm inspired by the spread of social contagion. Despite its simplicity, some open problems remain steadfastly unsolved, notably the…
A collection of open problems in celebration of Imre Leader's 60th birthday
Rahil Baber, Natalie Behague, Asier Calbet +10
One of the great pleasures of working with Imre Leader is to experience his infectious delight on encountering a compelling combinatorial problem. This collection of open problems…
A Note on Hamiltonian-Intersecting Families of Graphs
Imre Leader, Žarko Ranđelović, Ta Sheng Tan
How many graphs on an -point set can we find such that any two have connected intersection? Berger, Berkowitz, Devlin, Doppelt, Durham, Murthy and Vemuri showed that the maximum…
Galois groups of certain even octic polynomials
Malcolm Hoong Wai Chen, Angelina Yan Mui Chin, Ta Sheng Tan
Let be an irreducible polynomial where is a square. We give a method that completely describes the factorization patterns of a linear resolv…