Ta Sheng Tan
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Ta Sheng Tan has a total of 27 co-authors. Here are the top co-authors by number of shared publications:
- Imre Leader
University of Cambridge
10 shared publications - Kok Bin Wong
Institute of Mathematical Sciences, Faculty of Science, Universiti Malaya, Kuala Lumpur 50603, Malaysia
5 shared publications - Allan Lo
School of Mathematics University of Birmingham Birmingham UK
2 shared publications Imre Leader
2 shared publications- Thomas Britz
School of Mathematics and Statistics, UNSW Sydney, Sydney, Australia
2 shared publications - Wen Chean Teh
School of Mathematical Sciences, Universiti Sains Malaysia, USM, Malaysia
2 shared publications
Latest Publications
- Open Access
Odd Covers of Complete Graphs and Hypergraphs
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 $n$ odd, Buchanan, Clifton, Culver, Nie, O'Neill, Rombach and Yin showed that the odd cover number of $K_n$ is equal to $(n+1)/2$ or $(n+3)/2$, and they conjectured that it is always $(n+1)/2$. We prove this conjecture. For $n$ even, Babai and Frankl showed that the odd cover number of $K_n$ is always at least $n/2$, and the above authors and Radhakrishnan, Sen and Vishwanathan gave some values of $n$ for which equality holds. We give some new examples. Our constructions arise from some very symmetric constructions for the corresponding problem for complete hypergraphs. Thus the odd cover number of the complete 3-graph $K_n^{(3)}$ is the smallest number of complete 3-partite 3-graphs such that each 3-set is in an odd number of them. We show that the odd cover number of $K_n^{(3)}$ is exactly $n/2$ for even $n$, and we show that for odd $n$ it is $(n-1)/2$ for infinitely many values of $n$. We also show that for $r=3$ and $r=4$ the odd cover number of $K_n^{(r)}$ is strictly less than the partition number, answering a question of Buchanan, Clifton, Culver, Nie, O'Neill, Rombach and Yin for those values of $r$.Open AccessOdd Covers of Complete Graphs and Hypergraphs
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 $n$ odd, Buchanan, Clifton, Culver, Nie, O'Neill, Rombach and Yin showed that the odd cover number of $K_n$ is equal to $(n+1)/2$ or $(n+3)/2$, and they conjectured that it is always $(n+1)/2$. We prove this conjecture. For $n$ even, Babai and Frankl showed that the odd cover number of $K_n$ is always at least $n/2$, and the above authors and Radhakrishnan, Sen and Vishwanathan gave some values of $n$ for which equality holds. We give some new examples. Our constructions arise from some very symmetric constructions for the corresponding problem for complete hypergraphs. Thus the odd cover number of the complete 3-graph $K_n^{(3)}$ is the smallest number of complete 3-partite 3-graphs such that each 3-set is in an odd number of them. We show that the odd cover number of $K_n^{(3)}$ is exactly $n/2$ for even $n$, and we show that for odd $n$ it is $(n-1)/2$ for infinitely many values of $n$. We also show that for $r=3$ and $r=4$ the odd cover number of $K_n^{(r)}$ is strictly less than the partition number, answering a question of Buchanan, Clifton, Culver, Nie, O'Neill, Rombach and Yin for those values of $r$. - 15 July 2024
- Published by Elsevier in Discrete Mathematics
- Vol. 347 (11)
A Note on Hamiltonian-intersecting families of graphs
- 15 July 2024
- Published by Elsevier in Discrete Mathematics
- Vol. 347 (11)
A Note on Hamiltonian-intersecting families of graphs
- Open Access
- 26 June 2024
- Published by Springer Nature in Bulletin of the Malaysian Mathematical Sciences Society
- Vol. 47 (4) , 1-44
The Ramsey Numbers for Trees of Large Maximum Degree Versus the Wheel Graph $W_8$The Ramsey numbers $$R(T_n,W_8)$$ are determined for each tree graph $$T_n$$ of order $$n\ge 7$$ and maximum degree $$\Delta (T_n)$$ equal to either $$n-4$$ or $$n-5$$ . These numbers indicate strong support for the conjecture, due to Chen, Zhang and Zhang and to Hafidh and Baskoro, that $$R(T_n,W_m) = 2n-1$$ for each tree graph $$T_n$$ of order $$n\ge m-1$$ with $$\Delta (T_n)\le n-m+2$$ when $$m\ge 4$$ is even.- 26 June 2024
- Published by Springer Nature in Bulletin of the Malaysian Mathematical Sciences Society
- Vol. 47 (4) , 1-44
Open AccessThe Ramsey Numbers for Trees of Large Maximum Degree Versus the Wheel Graph $W_8$The Ramsey numbers $$R(T_n,W_8)$$ are determined for each tree graph $$T_n$$ of order $$n\ge 7$$ and maximum degree $$\Delta (T_n)$$ equal to either $$n-4$$ or $$n-5$$ . These numbers indicate strong support for the conjecture, due to Chen, Zhang and Zhang and to Hafidh and Baskoro, that $$R(T_n,W_m) = 2n-1$$ for each tree graph $$T_n$$ of order $$n\ge m-1$$ with $$\Delta (T_n)\le n-m+2$$ when $$m\ge 4$$ is even. - Open AccessThe Ramsey numbers for trees of order $n$ with maximum degree at least $n-5$ versus the wheel graph of order nineThe 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 strong support for the conjecture, due to Chen, Zhang and Zhang and to Hafidh and Baskoro, that $R(T_n,W_m) = 2n-1$ for each tree graph $T_n$ of order $n\geq m-1$ with $Δ(T_n)\leq n-m+2$ when $m\geq 4$ is even.Open AccessThe Ramsey numbers for trees of order $n$ with maximum degree at least $n-5$ versus the wheel graph of order nineThe 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 strong support for the conjecture, due to Chen, Zhang and Zhang and to Hafidh and Baskoro, that $R(T_n,W_m) = 2n-1$ for each tree graph $T_n$ of order $n\geq m-1$ with $Δ(T_n)\leq n-m+2$ when $m\geq 4$ is even.
- 4 October 2022
- Published by Elsevier in Applied Mathematics and Computation
- Vol. 438
Burnability of double spiders and path forests
- 4 October 2022
- Published by Elsevier in Applied Mathematics and Computation
- Vol. 438
Burnability of double spiders and path forests
- 30 September 2022
- Published by World Scientific Pub Co Pte Ltd in Journal of Algebra and Its Applications
- Vol. 22 (12)
Galois groups of certain even octic polynomials
Let [ ] be an irreducible polynomial where [ ] is a square. We give a method that completely describes the factorization patterns of a linear resolvent of [ ] using simple arithmetic conditions on [ ] and [ ]. As a result, we determine the exact six possible Galois groups of [ ] and completely classify all of them. As an application, we characterize the Galois groups of irreducible polynomials [ ]. We also use similar methods to obtain analogous results for the Galois groups of irreducible polynomials [ ].
- 30 September 2022
- Published by World Scientific Pub Co Pte Ltd in Journal of Algebra and Its Applications
- Vol. 22 (12)
Galois groups of certain even octic polynomials
Let [ ] be an irreducible polynomial where [ ] is a square. We give a method that completely describes the factorization patterns of a linear resolvent of [ ] using simple arithmetic conditions on [ ] and [ ]. As a result, we determine the exact six possible Galois groups of [ ] and completely classify all of them. As an application, we characterize the Galois groups of irreducible polynomials [ ]. We also use similar methods to obtain analogous results for the Galois groups of irreducible polynomials [ ].
- 1 August 2021
- Published by Elsevier in Discrete Mathematics
- Vol. 344 (8)
On the Ramsey numbers for the tree graphs versus certain generalised wheel graphs
- 1 August 2021
- Published by Elsevier in Discrete Mathematics
- Vol. 344 (8)
On the Ramsey numbers for the tree graphs versus certain generalised wheel graphs
- 27 April 2021
- Published by Springer Nature in Bulletin of the Malaysian Mathematical Sciences Society
- Vol. 44 (5) , 3511-3521
A Note on On-Line Ramsey Numbers of Stars and Paths
- 27 April 2021
- Published by Springer Nature in Bulletin of the Malaysian Mathematical Sciences Society
- Vol. 44 (5) , 3511-3521
A Note on On-Line Ramsey Numbers of Stars and Paths
- Open Access
Graph Burning: Tight Bounds on the Burning Numbers of Path Forests and Spiders
In 2016, Bonato, Janssen, and Roshanbin introduced graph burning as a discrete process that models the spread of social contagion. Although the burning process is a simple algorithm, the problem of determining the least number of rounds needed to completely burn a graph, called the burning number of the graph, is NP-complete even for elementary graph structures like spiders. An early conjecture that every connected graph of order square of m can be burned in at most m rounds is the main motivator of this study. Attempts to prove the conjecture have resulted in various upper bounds for the burning number and validation of the conjecture for certain elementary classes of graphs. In this work, we find a tight upper bound for the order of a spider for it to be burned within a given number of rounds. Our result shows that the tight bound depends on the structure of the spider under consideration, namely the number of arms. This strengthens the previously known results on spiders in relation to the conjecture. More importantly, this opens up potential enquiry into the connection between burning numbers and certain characteristics of graphs. Finally, a tight upper bound for the order of a path forest for it to be burned within a given number of rounds is obtained, thus completing previously known partial corresponding results.
Open AccessGraph Burning: Tight Bounds on the Burning Numbers of Path Forests and Spiders
In 2016, Bonato, Janssen, and Roshanbin introduced graph burning as a discrete process that models the spread of social contagion. Although the burning process is a simple algorithm, the problem of determining the least number of rounds needed to completely burn a graph, called the burning number of the graph, is NP-complete even for elementary graph structures like spiders. An early conjecture that every connected graph of order square of m can be burned in at most m rounds is the main motivator of this study. Attempts to prove the conjecture have resulted in various upper bounds for the burning number and validation of the conjecture for certain elementary classes of graphs. In this work, we find a tight upper bound for the order of a spider for it to be burned within a given number of rounds. Our result shows that the tight bound depends on the structure of the spider under consideration, namely the number of arms. This strengthens the previously known results on spiders in relation to the conjecture. More importantly, this opens up potential enquiry into the connection between burning numbers and certain characteristics of graphs. Finally, a tight upper bound for the order of a path forest for it to be burned within a given number of rounds is obtained, thus completing previously known partial corresponding results.
- 1 April 2019
- Published by Elsevier in Discrete Mathematics
- Vol. 342 (4) , 1186-1190
Rainbow Hamiltonian cycles in strongly edge-colored graphs
- 1 April 2019
- Published by Elsevier in Discrete Mathematics
- Vol. 342 (4) , 1186-1190
Rainbow Hamiltonian cycles in strongly edge-colored graphs