default search action
Cheng Yeaw Ku
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
- [j33]Cheng Yeaw Ku, Kok Bin Wong:
Diversity and intersecting theorems for weak compositions. Discret. Math. 348(2): 114250 (2025) - 2023
- [j32]Zhi Kang Samuel Koh
, Cheng Yeaw Ku, Kok Bin Wong:
Alternating sign property of the perfect matching derangement graph. J. Comb. Theory A 194: 105706 (2023) - 2021
- [j31]Cheng Yeaw Ku, Kok Bin Wong:
On the Number of Nonnegative Sums for Semi-partitions. Graphs Comb. 37(6): 2803-2823 (2021) - 2020
- [j30]Cheng Yeaw Ku, Kok Bin Wong:
Erdős-Ko-Rado theorems for set partitions with certain block size. J. Comb. Theory A 172: 105180 (2020)
2010 – 2019
- 2019
- [j29]Cheng Yeaw Ku, Kok Bin Wong:
On Cross Parsons Numbers. Graphs Comb. 35(1): 287-301 (2019) - 2018
- [j28]Cheng Yeaw Ku, Kok Bin Wong:
On No-Three-In-Line Problem on m-Dimensional Torus. Graphs Comb. 34(2): 355-364 (2018) - 2017
- [j27]Cheng Yeaw Ku, Terry Lau
On the partition associated to the smallest eigenvalues of the k-point fixing graph. Eur. J. Comb. 63: 70-94 (2017) - 2016
- [j26]Cheng Yeaw Ku, Kok Bin Wong:
A non-trivial intersection theorem for permutations with fixed number of cycles. Discret. Math. 339(2): 646-657 (2016) - 2015
- [j25]Cheng Yeaw Ku, Kok Bin Wong:
A Deza-Frankl Type Theorem for Set Partitions. Electron. J. Comb. 22(1): 1 (2015) - [j24]Cheng Yeaw Ku, Kok Bin Wong:
A Generalization of Very Odd Sequences. Electron. J. Comb. 22(2): 2 (2015) - [j23]Alan J. Aw
The covering radius problem for sets of 1-factors of the complete uniform hypergraphs. Discret. Math. 338(6): 875-884 (2015) - [j22]Cheng Yeaw Ku, Kok Bin Wong:
On r-cross t-intersecting families for weak compositions. Discret. Math. 338(7): 1090-1095 (2015) - 2014
- [j21]Cheng Yeaw Ku, Kok Bin Wong:
An Erdős-Ko-Rado Theorem for Permutations with Fixed Number of Cycles. Electron. J. Comb. 21(3): 3 (2014) - 2013
- [j20]Cheng Yeaw Ku, Kok Bin Wong:
Generalizing Tutte's theorem and maximal non-matchable graphs. Discret. Math. 313(20): 2162-2167 (2013) - [j19]Cheng Yeaw Ku, Kok Bin Wong:
A Kruskal-Katona type theorem for integer partitions. Discret. Math. 313(20): 2239-2246 (2013) - [j18]Cheng Yeaw Ku, Kok Bin Wong:
An analogue of the Erdős-Ko-Rado theorem for weak compositions. Discret. Math. 313(21): 2463-2468 (2013) - [j17]Cheng Yeaw Ku, Kok Bin Wong:
Solving the Ku-Wales conjecture on the eigenvalues of the derangement graph. Eur. J. Comb. 34(6): 941-956 (2013) - [j16]Cheng Yeaw Ku, Kok Bin Wong:
An analogue of the Hilton-Milner theorem for set partitions. J. Comb. Theory A 120(7): 1508-1520 (2013) - 2012
- [j15]Cheng Yeaw Ku, Kok Bin Wong:
Properties of θ-super positive graphs. Electron. J. Comb. 19(1): 37 (2012) - [j14]Cheng Yeaw Ku, Kok Bin Wong:
On Cross-Intersecting Families of Set Partitions. Electron. J. Comb. 19(4): 49 (2012) - 2011
- [j13]Cheng Yeaw Ku, Kok Bin Wong:
Maximum Multiplicity of Matching Polynomial Roots and Minimum Path Cover in General Graphs. Electron. J. Comb. 18(1) (2011) - [j12]Cheng Yeaw Ku, Kok Bin Wong:
Generalized D-graphs for nonzero roots of the matching polynomial. Discret. Math. 311(20): 2174-2186 (2011) - [j11]Cheng Yeaw Ku, Kok Bin Wong:
The group marriage problem. J. Comb. Theory A 118(2): 672-680 (2011) - 2010
- [j10]Cheng Yeaw Ku, Kok Bin Wong:
Extensions of barrier sets to nonzero roots of the matching polynomial. Discret. Math. 310(24): 3544-3550 (2010) - [j9]Cheng Yeaw Ku, William Chen:
An analogue of the Gallai-Edmonds Structure Theorem for non-zero roots of the matching polynomial. J. Comb. Theory B 100(2): 119-127 (2010) - [j8]Cheng Yeaw Ku, David B. Wales:
Eigenvalues of the derangement graph. J. Comb. Theory A 117(3): 289-312 (2010)
2000 – 2009
- 2009
- [j7]Cheng Yeaw Ku, Kok Bin Wong:
Maximum Multiplicity of a Root of the Matching Polynomial of a Tree and Minimum Path Cover. Electron. J. Comb. 16(1) (2009) - [j6]Cheng Yeaw Ku, Benjamin B. McMillan
Independent sets of maximal size in tensor powers of vertex-transitive graphs. J. Graph Theory 60(4): 295-301 (2009) - 2008
- [j5]Cheng Yeaw Ku, David Renshaw:
Erdos-Ko-Rado theorems for permutations and set partitions. J. Comb. Theory A 115(6): 1008-1020 (2008) - 2007
- [j4]Cheng Yeaw Ku, Tony W. H. Wong:
Intersecting Families in the Alternating Group and Direct Product of Symmetric Groups. Electron. J. Comb. 14(1) (2007) - 2006
- [j3]Peter Keevash, Cheng Yeaw Ku:
A random construction for permutation codes and the covering radius. Des. Codes Cryptogr. 41(1): 79-86 (2006) - [j2]Cheng Yeaw Ku, Imre Leader:
An Erd˝s-Ko-Rado theorem for partial permutations. Discret. Math. 306(1): 74-86 (2006) - 2003
- [j1]Peter J. Cameron
Intersecting families of permutations. Eur. J. Comb. 24(7): 881-890 (2003)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-18 23:43 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: