Cheng Yeaw Ku

According to our database1, Cheng Yeaw Ku authored at least 33 papers between 2003 and 2025.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2025
Diversity and intersecting theorems for weak compositions.
Discret. Math., 2025

2023
Alternating sign property of the perfect matching derangement graph.
J. Comb. Theory A, 2023

2021
On the Number of Nonnegative Sums for Semi-partitions.
Graphs Comb., 2021

2020
Erdős-Ko-Rado theorems for set partitions with certain block size.
J. Comb. Theory A, 2020

2019
On Cross Parsons Numbers.
Graphs Comb., 2019

2018
On No-Three-In-Line Problem on m-Dimensional Torus.
Graphs Comb., 2018

2017
On the partition associated to the smallest eigenvalues of the k-point fixing graph.
Eur. J. Comb., 2017

2016
A non-trivial intersection theorem for permutations with fixed number of cycles.
Discret. Math., 2016

2015
On r-cross t-intersecting families for weak compositions.
Discret. Math., 2015

The covering radius problem for sets of 1-factors of the complete uniform hypergraphs.
Discret. Math., 2015

A Generalization of Very Odd Sequences.
Electron. J. Comb., 2015

A Deza-Frankl Type Theorem for Set Partitions.
Electron. J. Comb., 2015

2014
An Erdős-Ko-Rado Theorem for Permutations with Fixed Number of Cycles.
Electron. J. Comb., 2014

2013
An analogue of the Hilton-Milner theorem for set partitions.
J. Comb. Theory A, 2013

Solving the Ku-Wales conjecture on the eigenvalues of the derangement graph.
Eur. J. Comb., 2013

A Kruskal-Katona type theorem for integer partitions.
Discret. Math., 2013

Generalizing Tutte's theorem and maximal non-matchable graphs.
Discret. Math., 2013

An analogue of the Erdős-Ko-Rado theorem for weak compositions.
Discret. Math., 2013

2012
On Cross-Intersecting Families of Set Partitions.
Electron. J. Comb., 2012

Properties of θ-super positive graphs.
Electron. J. Comb., 2012

2011
The group marriage problem.
J. Comb. Theory A, 2011

Generalized D-graphs for nonzero roots of the matching polynomial.
Discret. Math., 2011

Maximum Multiplicity of Matching Polynomial Roots and Minimum Path Cover in General Graphs.
Electron. J. Comb., 2011

2010
Eigenvalues of the derangement graph.
J. Comb. Theory A, 2010

An analogue of the Gallai-Edmonds Structure Theorem for non-zero roots of the matching polynomial.
J. Comb. Theory B, 2010

Extensions of barrier sets to nonzero roots of the matching polynomial.
Discret. Math., 2010

2009
Independent sets of maximal size in tensor powers of vertex-transitive graphs.
J. Graph Theory, 2009

Maximum Multiplicity of a Root of the Matching Polynomial of a Tree and Minimum Path Cover.
Electron. J. Comb., 2009

2008
Erdos-Ko-Rado theorems for permutations and set partitions.
J. Comb. Theory A, 2008

2007
Intersecting Families in the Alternating Group and Direct Product of Symmetric Groups.
Electron. J. Comb., 2007

2006
An Erd˝s-Ko-Rado theorem for partial permutations.
Discret. Math., 2006

A random construction for permutation codes and the covering radius.
Des. Codes Cryptogr., 2006

2003
Intersecting families of permutations.
Eur. J. Comb., 2003


  Loading...