Ta Sheng Tan

activity

20102024

collaborators

6 papers

math.CO2024

The Ramsey numbers for trees of order $n$ with maximum degree at least $n - 5$ versus the wheel graph of order nine

Zhi Yee Chng, Thomas Britz, Ta Sheng Tan +1

The Ramsey numbers $R (T_{n}, W_{8})$ are determined for each tree graph $T_{n}$ of order $n \geq 7$ and maximum degree $Δ (T_{n})$ equal to either $n - 4$ or $n - 5$ . These numbers indicate stron…

math.CO2023

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…

math.CO2023

A Note on Hamiltonian-Intersecting Families of Graphs

Imre Leader, Žarko Ranđelović, Ta Sheng Tan

How many graphs on an $n$ -point set can we find such that any two have connected intersection? Berger, Berkowitz, Devlin, Doppelt, Durham, Murthy and Vemuri showed that the maximum…

math.CO2022

Burnability of Double Spiders and Path Forests

Ta Sheng Tan, Wen Chean Teh

The burning number of a graph can be used to measure the spreading speed of contagion in a network. The burning number conjecture is arguably the main unresolved conjecture related…

math.CO2014

Cycles in Oriented 3-graphs

Imre Leader, Ta Sheng Tan

An oriented 3-graph consists of a family of triples (3-sets), each of which is given one of its two possible cyclic orientations. A cycle in an oriented 3-graph is a positive sum o…

math.CO2010

Traces Without Maximal Chains