Curriculum Vitae

DR. TAN TA SHENG

Senior Lecturer
  • Institute of Mathematical Sciences
    Faculty of Science
  • 03-79677134

AREAS OF EXPERTISE

  • COMBINATORICS
    Extremal Combinatorics, Ramsey Theory, Graph Theory

ACADEMIC QUALIFICATION

  • Advanced Diploma, (Mathematics)
    Cambridge University, United Kingdom
  • Doctoral Degree (PhD), (Mathematics)
    Cambridge University, United Kingdom
  • Bachelor Degree, (Arts)
    Cambridge University, United Kingdom

AWARD AND STEWARDSHIP

  • CERTIFICATE OF EXCELLENT SERVICE
    University of Malaya, 2016 (University)

PUBLICATIONS

Article in Journal
WoS
  1. Tan, Ta Sheng; Teh, Wen Chean (2023). Burnability of double spiders and path forests, APPLIED MATHEMATICS AND COMPUTATION. 438. doi:10.1016/j.amc.2022.127574
  2. Chen, Malcolm Hoong Wai; Chin, Angelina Yan Mui; Tan, Ta Sheng (2022). Galois groups of certain even octic polynomials, JOURNAL OF ALGEBRA AND ITS APPLICATIONS. . doi:10.1142/S0219498823502638
  3. Chin, A. Y. M., Tan, T. S., & Ruzali, W. (2021). The number of non-sources in the directed graphs of rings of integers modulo a prime power. Ars Combinatoria, 154, 101-108.
  4. Chng, Z. Y., Tan, T. S., & Wong, K. B. (2021). On the Ramsey numbers for the tree graphs versus certain generalised wheel graphs. Discrete Mathematics, 344(8), 12. doi: 10.1016/j.disc.2021.112440
  5. Latip, F., & Tan, T. S. (2021). A Note on On-Line Ramsey Numbers of Stars and Paths. Bulletin of the Malaysian Mathematical Sciences Society, 44(5), 3511-3521. doi: 10.1007/s40840-021-01130-x
  6. Sim, K. A., Tan, T. S., & Bin Wong, K. (2021). A NOTE ON THE MIXED VAN DER WAERDEN NUMBER. Bulletin of the Korean Mathematical Society, 58(6), 1341-1354. doi: 10.4134/BKMS.b200718
  7. Tan, T. S., & Teh, W. C. (2020). Graph burning: Tight bounds on the burning numbers of path forests and spiders. Applied Mathematics and Computation, 385, 9. doi: 10.1016/j.amc.2020.125447
  8. Cheng, Y. Y., Sun, Q., Tan, T. S., Wang, G. H. (2019). Rainbow Hamiltonian cycles in strongly edge-colored graphs. Discrete Mathematics, 342(4), 1186-1190. doi:10.1016/j.disc.2019.01.002
  9. Cheng, Y. Y., Tan, T. S., Wang, G. H. (2018). A note on rainbow matchings in strongly edge-colored graphs. Discrete Mathematics, 341(10), 2762-2767. doi:10.1016/j.disc.2018.06.019
  10. Leader, I., Tan, T. S. (2018). Improved Bounds for the Graham-Pollak Problem for Hypergraphs. Electronic Journal of Combinatorics, 25(1), 5.
  11. Leader, I., Milicevic, L., Tan, T. S. (2018). Decomposing the complete r-graph. Journal of Combinatorial Theory Series A, 154, 21-31. doi:10.1016/j.jcta.2017.08.008
  12. Sim, K. A., Tan, T. S., Bin Wong, K. (2018). On the Burning Number of Generalized Petersen Graphs. Bulletin of the Malaysian Mathematical Sciences Society, 41(3), 1657-1670. doi:10.1007/s40840-017-0585-6
  13. Sim, K. A., Tan, T. S., Wong, K. B. (2018). ON THE MINIMUM ORDER OF 4-LAZY COPS-WIN GRAPHS. Bulletin of the Korean Mathematical Society, 55(6), 1667-1690. doi:10.4134/BKMS.b170948
  14. Chia, G. L., Tan, T. S. (2017). On the Brush Number of the Cartesian Product of Tree with Path or Cycle. Bulletin of the Malaysian Mathematical Sciences Society, 40(3), 1265-1275.
  15. Sim, K. A., Tan, T. S., Wong, K. B. (2017). Lazy cops and robbers on generalized hypercubes. Discrete Mathematics, 340(7), 1693-1704.
  16. Tan, T. S. (2017). The Brush Number of the Two-Dimensional. Utilitas Mathematica, 104, 321-331
  17. Gruslys, Vytautas; Leader, Imre; Tan, Ta Sheng (2016). Tiling with arbitrary tiles, PROCEEDINGS OF THE LONDON MATHEMATICAL SOCIETY. 112, 1019-1039. doi:10.1112/plms/pdw017
  18. Leader, Imre; Tan, Ta Sheng (2016). Connected Colourings of Complete Graphs and Hypergraphs, GRAPHS AND COMBINATORICS. 32(1), 257-269. doi:10.1007/s00373-015-1537-2
  19. Leader, I., Tan, T. S. (2015). Cycles in Oriented 3-Graphs, Discrete Computational Geometry. 54(2432-443), Article
ESCI
  1. Sim, Kai An; Tan, Ta Sheng; Wong, Kok Bin (2022). Lazy Cops and Robber on Certain Cayley Graph, MALAYSIAN JOURNAL OF FUNDAMENTAL AND APPLIED SCIENCES. 18(2), 148-156
Others
  1. Lo, A. & Tan, T.S. 2014. A note on large rainbow matchings in edge-coloured graphs. Graphs and Combinatorics 30(2): 389-393.
  2. Leader, I. & Tan, T.S. 2010. Directed simplices in higher order tournaments. Mathematika 56: 173-181.
  3. Tan, T.S. 2010. Traces without maximal chains. Electronic Journal of Combinatorics 17: N16.

RESEARCH PROJECT

National
  1. 2019 - 2023, Fundamental Research Grant Scheme (FRGS)
    Problems In Group Factorizations ( Co-Researcher)
  2. 2019 - 2022, Fundamental Research Grant Scheme (FRGS)
    Maps Of Tensors And Kronecker Products Of Matrices ( Co-Researcher)
  3. 2018 - 2021, RU Geran - Fakulti Program
    Intersecting Families And Related Problems In Combinatorics ( Co-Researcher)
  4. 2017 - 2019, UM Grant - Frontier Research Grant
    Some Grpahs Associated With Finite Groups And Related Group Invariants ( Co-Researcher)
  5. 2018 - 2019, RU Geran - Fakulti Program
    Extremal Combinatorial Problems In Edge-coloured Graphs ( Principal Investigator(PI))
  6. 2014 - 2017, Fundamental Research Grant Scheme (FRGS)
    On Extremal Combinatorics With The Application Of Probabilistic Methods ( Principal Investigator(PI))
  7. 2015 - 2017, Geran Penyelidikan Universiti Malaya (UMRG) - AFR (Frontier Science)
    Some graph invariants related to algebraic structures ( Co-Researcher)
  8. 2013 - 2015, Fundamental Research Grant Scheme (FRGS)
    Unsolved Problems in Graph Theory ( Consultant)

SUPERVISION

Postgraduate Student
  1. (2017) LAZY COP NUMBER AND OTHER RELATED GRAPH PARAMETERS, SIM KAI AN
  2. (2018) SOME PROPERTIES OF GRAPHS ASSOCIATED WITH CERTAIN FINITE RINGS, WAN MUHAMMAD AFIF BIN WAN RUZALI