Mountain View

  Ku Cheng Yeaw


   Office: SPMS-MAS-05-11
   School of Physical & Mathematical Sciences
   Nanyang Technological University
   21 Nanyang Link, Singapore 637371
   Email: cyku@ntu.edu.sg


Welcome! I am a senior lecturer in the Division of Mathematical Sciences (SPMS) at Nanyang Technological University.

Education

PhD Mathematics (2005), Queen Mary University of London
Advisor: Peter J. Cameron

My research interests lie in combinatorics and graph theory. In particular, I am interested in matching polynomials, extremal problems for permutations and related combinatorial structures, probabilistic and algebraic methods used to understand these structures.

Publications

  1. C.Y. Ku and K.B. Wong, An Erdős-Ko-Rado theorem For Minimal Covers, Bulletin of the Korean Mathematical Society, 54 (2017) 875-894.
  2.  
  3. C.Y. Ku, Terry Lau, and K.B. Wong, On the partition associated to the smallest eigenvalues of the k-point fixing graph, European Journal of Combinatorics, 63 (2017) 70-94.
  4.  
  5. C. Y. Ku, Terry Lau and K. B. Wong, Largest independent sets of certain regular subgraphs of the derangement graph, Journal of Algebraic Combinatorics, 44(1): 81-98 (2016)
  6.  
  7. C. Y. Ku, Terry Lau and K. B. Wong, The smallest eigenvalue of the 1-point fixing graph, Linear Algebra and Its Applications, 493 (2016), 433-446.
  8.  
  9. C. Y. Ku and K. B. Wong, A non-trivial intersection theorem for permutations with fixed number of cycles. Discrete Mathematics 339(2): 646-657 (2016)
  10.  
  11. C. Y. Ku and K. B. Wong, An analogue of the Hilton-Milner Theorem for weak compositions, Bull. Korean Math. Soc. 52(3) (2015), 1007-1025.
  12.  
  13. C. Y. Ku and K. B. Wong, A generalization of very odd sequences, The Electronic Journal of Combinatorics, 22(2) (2015), #P2.12.
  14.  
  15. C. Y. Ku and K. B. Wong, A Deza-Frankl Type Theorem for Set Partitions, The Electronic Journal of Combinatorics, 22(1) (2015), #P1.84.
  16.  
  17. C. Y. Ku and K. B. Wong, On r-cross t-intersecting families for weak compositions, Discrete Mathematics, 338(7) (2015), 1090–1095.
  18.  
  19. Alan J. Aw and C. Y. Ku, The covering radius problem for sets of 1-factors of the complete uniform hypergraphs, Discrete Mathematics, 338(6) (2015), 875–884.
  20.  
  21. C. Y. Ku, Terry Lau and K. B. Wong, Cayley graphs on symmetric group generated by elements fixing k points, Linear Algebra and Its Applications, 471 (2015), 405–426.
  22.  
  23. C. Y. Ku and K. B. Wong, An Erdos-Ko-Rado Theorem for permutations with fixed number of cycles, The Electronic Journal of Combinatorics, 21(3) (2014), #P3.16.
  24.  
  25. C. Y. Ku and K. B. Wong, Gallai-Edmonds structure theorem for weighted matching polynomial, Linear Algebra and its Applications, 439 (2013), 3387–3411.
  26.  
  27. C. Y. Ku and K. B. Wong, An analogue of the Erdos-Ko-Rado theorem for weak compositions, Discrete Mathematics, 313 (2013), 2463–2468.
  28.  
  29. C. Y. Ku and K. B. Wong, A Kruskal–Katona type theorem for integer partitions, Discrete Mathematics, 313 (2013), 2239–2246.
  30.  
  31. C. Y. Ku and K. B. Wong, Generalizing Tutte’s theorem and maximal non-matchable graphs, Discrete Mathematics, 313 (2013), 2162-2167.
  32.  
  33. C.Y. Ku and K.B. Wong, On r-cross intersecting families of sets, Far East Journal of Mathematical Sciences, 75 (2013), 295-300.
  34.  
  35. C. Y. Ku and K. B. Wong, An analogue of Hilton-Milner theorem for set partitions, Journal of Combinatorial Theory Series A, 120 (2013), 1508–1520.
  36.  
  37. C. Y. Ku and K. B. Wong, Solving the Ku-Wales conjecture on the eigenvalues of the derangement graph, European Journal of Combinatorics, Volume 34, Issue 6, (2013), 941–956.
  38.  
  39. C. Y. Ku and K. B. Wong, On 2-factor hamiltonian regular bipartite graphs, Acta Mathematica Hungarica, 138 (2013), 173–178.
  40.  
  41. C. Y. Ku and K. B. Wong, On cross-intersecting families of set partitions, The Electronic Journal of Combinatorics, 19(4) (2012), #49.
  42.  
  43. C. Y. Ku and K. B. Wong, Properties of $\theta$-super positive graphs, The Electronic Journal of Combinatorics, 19 (2012), #P37.
  44.  
  45. C. Y. Ku and K. B. Wong, Generalized D-graphs for nonzero roots of the matching polynomial, Discrete Mathematics, 311 (2011), 2174–2186.
  46.  
  47. C. Y. Ku and K. B. Wong, Maximum multiplicity of matching polynomial roots and minimum path cover in general graph, The Electronic Journal of Combinatorics, 18 (2011), #P38.
  48.  
  49. C. Y. Ku and K. B. Wong, Group marriage problem, Journal of Combinatorial Theory Series A, 118 (2011), 672-680.
  50.  
  51. C. Y. Ku and K. B. Wong, Extensions of barrier sets to nonzero roots of the matching polynomial, Discrete Mathematics, 310 (2010), 3544-3550.
  52.  
  53. W. Chen and C. Y. Ku, An analogue of the Gallai-Edmonds structure theorem for nonzero roots of the matching polynomial, Journal of Combinatorial Theory Series B, 100 (2010), 119-127.
  54.  
  55. C. Y. Ku and D. Wales, Eigenvalues of the derangement graph, Journal of Combinatorial Theory Series A, 117 (2010), 289-312.
  56.  
  57. C. Y. Ku and K. B. Wong, Maximum multiplicity of a root of the matching polynomial of a tree and minimum path cover, The Electronic Journal of Combinatorics, 16(1) (2009), #R81.
  58.  
  59. C. Y. Ku and B. McMillan, Independent sets of maximal size in tensor powers of vertex transitive graphs, Journal of Graph Theory, 60 (4) (2009), 295-301.
  60.  
  61. C. Y. Ku and D. Renshaw, Erdos-Ko-Rado theorems for permutations and set partitions, Journal of Combinatorial Theory Series A, 115 (2008), 1008-1020.
  62.  
  63. C. Y. Ku and T. W. H. Wong, Intersecting families in the alternating group and direct product of symmetric groups, The Electronic Journal of Combinatorics, 14 (2007), #R25.
  64.  
  65. P. Keevash and C. Y. Ku, A random construction for permutation codes and the covering radius, Des. Codes. Crypt., 41 (2006), 79-86.
  66.  
  67. I. Leader and C. Y. Ku, An Erdos-Ko-Rado theorem for partial permutations, Discrete Mathematics, 306 (2006), 74-86.
  68.  
  69. P. J. Cameron and C. Y. Ku, Intersecting families of permutations, European Journal of Combinatorics, 24 (7) (2003), 881-890.


Links