Ta Sheng Tan

Available identifiers

zbMath Open tan.ta-shengMaRDI QIDQ251533

List of research outcomes

Publication	Date of Publication	Type
A note on Hamiltonian-intersecting families of graphs	2024-08-19	Paper
The Ramsey numbers for trees of large maximum degree versus the wheel graph \(W_8\)	2024-08-13	Paper
Galois groups of certain even octic polynomials	2023-11-16	Paper
A collection of open problems in celebration of Imre Leader's 60th birthday	2023-10-27	Paper
A Note on Hamiltonian-Intersecting Families of Graphs	2023-09-01	Paper
Burnability of double spiders and path forests	2022-11-16	Paper
Burnability of Double Spiders and Path Forests	2022-07-27	Paper
https://portal.mardi4nfdi.de/entity/Q5033249	2022-02-22	Paper
A note on on-line Ramsey numbers of stars and paths	2021-08-24	Paper
On the Ramsey numbers for the tree graphs versus certain generalised wheel graphs	2021-06-14	Paper
Graph burning: tight bounds on the burning numbers of path forests and spiders	2021-03-12	Paper
Graph Burning: Tight Bounds on the Burning Numbers of Path Forests and Spiders	2019-10-10	Paper
Rainbow Hamiltonian cycles in strongly edge-colored graphs	2019-02-20	Paper
https://portal.mardi4nfdi.de/entity/Q4614817	2019-01-31	Paper
A note on rainbow matchings in strongly edge-colored graphs	2018-08-15	Paper
On the burning number of generalized Petersen graphs	2018-07-24	Paper
The Brush Number of the Two-Dimensional Torus	2018-02-23	Paper
Improved bounds for the Graham-Pollak problem for hypergraphs	2018-01-15	Paper
Decomposing the complete \(r\)-graph	2017-11-09	Paper
Lazy Cops and Robbers on generalized hypercubes	2017-05-10	Paper
Tiling with arbitrary tiles	2016-08-09	Paper
Connected colourings of complete graphs and hypergraphs	2016-03-02	Paper
Cycles in oriented 3-graphs	2015-12-02	Paper
A note on large rainbow matchings in edge-coloured graphs	2014-09-19	Paper
Traces without maximal chains	2010-03-26	Paper
Directed simplices in higher order tournaments	2010-02-19	Paper
A Note on Graph Burning of Path Forests	N/A	Paper
The Ramsey numbers for trees of order $n$ with maximum degree at least $n-5$ versus the wheel graph of order nine	N/A	Paper

Research outcomes over time

This page was built for person: Ta Sheng Tan