Cheng Yeaw Ku

According to our database, Cheng Yeaw Ku authored at least 32 papers between 2003 and 2023.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2023

Alternating sign property of the perfect matching derangement graph.

Zhi Kang Samuel Koh, Cheng Yeaw Ku, Kok Bin Wong

J. Comb. Theory A, 2023

2021

On the Number of Nonnegative Sums for Semi-partitions.

Cheng Yeaw Ku, Kok Bin Wong

Graphs Comb., 2021

2020

Erdős-Ko-Rado theorems for set partitions with certain block size.

Cheng Yeaw Ku, Kok Bin Wong

J. Comb. Theory A, 2020

2019

On Cross Parsons Numbers.

Cheng Yeaw Ku, Kok Bin Wong

Graphs Comb., 2019

2018

On No-Three-In-Line Problem on m-Dimensional Torus.

Cheng Yeaw Ku, Kok Bin Wong

Graphs Comb., 2018

2017

On the partition associated to the smallest eigenvalues of the k-point fixing graph.

Cheng Yeaw Ku, Terry Lau, Kok Bin Wong

Eur. J. Comb., 2017

2016

A non-trivial intersection theorem for permutations with fixed number of cycles.

Cheng Yeaw Ku, Kok Bin Wong

Discret. Math., 2016

2015

On r-cross t-intersecting families for weak compositions.

Cheng Yeaw Ku, Kok Bin Wong

Discret. Math., 2015

The covering radius problem for sets of 1-factors of the complete uniform hypergraphs.

Alan J. Aw, Cheng Yeaw Ku

Discret. Math., 2015

A Generalization of Very Odd Sequences.

Cheng Yeaw Ku, Kok Bin Wong

Electron. J. Comb., 2015

A Deza-Frankl Type Theorem for Set Partitions.

Cheng Yeaw Ku, Kok Bin Wong

Electron. J. Comb., 2015

2014

An Erdős-Ko-Rado Theorem for Permutations with Fixed Number of Cycles.

Cheng Yeaw Ku, Kok Bin Wong

Electron. J. Comb., 2014

2013

An analogue of the Hilton-Milner theorem for set partitions.

Cheng Yeaw Ku, Kok Bin Wong

J. Comb. Theory A, 2013

Solving the Ku-Wales conjecture on the eigenvalues of the derangement graph.

Cheng Yeaw Ku, Kok Bin Wong

Eur. J. Comb., 2013

A Kruskal-Katona type theorem for integer partitions.

Cheng Yeaw Ku, Kok Bin Wong

Discret. Math., 2013

Generalizing Tutte's theorem and maximal non-matchable graphs.

Cheng Yeaw Ku, Kok Bin Wong

Discret. Math., 2013

An analogue of the Erdős-Ko-Rado theorem for weak compositions.

Cheng Yeaw Ku, Kok Bin Wong

Discret. Math., 2013

2012

On Cross-Intersecting Families of Set Partitions.

Cheng Yeaw Ku, Kok Bin Wong

Electron. J. Comb., 2012

Properties of θ-super positive graphs.

Cheng Yeaw Ku, Kok Bin Wong

Electron. J. Comb., 2012

2011

The group marriage problem.

Cheng Yeaw Ku, Kok Bin Wong

J. Comb. Theory A, 2011

Generalized D-graphs for nonzero roots of the matching polynomial.

Cheng Yeaw Ku, Kok Bin Wong

Discret. Math., 2011

Maximum Multiplicity of Matching Polynomial Roots and Minimum Path Cover in General Graphs.

Cheng Yeaw Ku, Kok Bin Wong

Electron. J. Comb., 2011

2010

Eigenvalues of the derangement graph.

Cheng Yeaw Ku, David B. Wales

J. Comb. Theory A, 2010

An analogue of the Gallai-Edmonds Structure Theorem for non-zero roots of the matching polynomial.

Cheng Yeaw Ku, William Chen

J. Comb. Theory B, 2010

Extensions of barrier sets to nonzero roots of the matching polynomial.

Cheng Yeaw Ku, Kok Bin Wong

Discret. Math., 2010

2009

Independent sets of maximal size in tensor powers of vertex-transitive graphs.

Cheng Yeaw Ku, Benjamin B. McMillan

J. Graph Theory, 2009

Maximum Multiplicity of a Root of the Matching Polynomial of a Tree and Minimum Path Cover.

Cheng Yeaw Ku, Kok Bin Wong

Electron. J. Comb., 2009

2008

Erdos-Ko-Rado theorems for permutations and set partitions.

Cheng Yeaw Ku, David Renshaw

J. Comb. Theory A, 2008

2007

Intersecting Families in the Alternating Group and Direct Product of Symmetric Groups.

Cheng Yeaw Ku, Tony W. H. Wong

Electron. J. Comb., 2007

2006

An Erd˝s-Ko-Rado theorem for partial permutations.

Cheng Yeaw Ku, Imre Leader

Discret. Math., 2006

A random construction for permutation codes and the covering radius.

Peter Keevash, Cheng Yeaw Ku

Des. Codes Cryptogr., 2006

2003

Intersecting families of permutations.

Peter J. Cameron, Cheng Yeaw Ku

Eur. J. Comb., 2003