The following pages link to Cheng Yeaw Ku (Q389465):
Displayed 45 items.
- An analogue of the Erdős-Ko-Rado theorem for weak compositions (Q389467) (← links)
- Generalizing Tutte's theorem and maximal non-matchable graphs (Q390291) (← links)
- A Kruskal-Katona type theorem for integer partitions (Q390307) (← links)
- An Erdős-Ko-Rado theorem for permutations with fixed number of cycles (Q405301) (← links)
- Properties of \(\theta\)-super positive graphs (Q426799) (← links)
- Extensions of barrier sets to nonzero roots of the matching polynomial (Q607015) (← links)
- The group marriage problem. (Q618319) (← links)
- Maximum multiplicity of matching polynomial roots and minimum path cover in general graphs (Q625411) (← links)
- Generalized \(D\)-graphs for nonzero roots of the matching polynomial (Q641190) (← links)
- Largest independent sets of certain regular subgraphs of the derangement graph (Q737973) (← links)
- A random construction for permutation codes and the covering radius (Q851770) (← links)
- Intersecting families in the alternating group and direct product of symmetric groups (Q871132) (← links)
- A non-trivial intersection theorem for permutations with fixed number of cycles (Q898122) (← links)
- The smallest eigenvalues of the 1-point fixing graph (Q905733) (← links)
- Erdős-Ko-Rado theorems for permutations and set partitions (Q941314) (← links)
- Eigenvalues of the derangement graph (Q965212) (← links)
- An analogue of the Gallai-Edmonds structure theorem for non-zero roots of the matching polynomial (Q965239) (← links)
- Eigenvalues of the matching derangement graph (Q1631395) (← links)
- The spectrum of eigenvalues for certain subgraphs of the \(k\)-point fixing graph (Q1698586) (← links)
- On cross Parsons numbers (Q1733877) (← links)
- On no-three-in-line problem on \(m\)-dimensional torus (Q1743688) (← links)
- On cross-intersecting families of set partitions (Q1953361) (← links)
- On the number of nonnegative sums for semi-partitions (Q2053739) (← links)
- Alternating sign property of the perfect matching derangement graph (Q2102701) (← links)
- On 2-factor Hamiltonian regular bipartite graphs (Q2250805) (← links)
- Cayley graph on symmetric group generated by elements fixing \(k\) points (Q2261552) (← links)
- Erdős-Ko-Rado theorems for set partitions with certain block size (Q2299629) (← links)
- On the number of nonnegative sums for certain function (Q2302008) (← links)
- On \(r\)-cross \(t\)-intersecting families for weak compositions (Q2339425) (← links)
- A generalization of very odd sequences (Q2341058) (← links)
- A Deza-Frankl type theorem for set partitions (Q2341077) (← links)
- An analogue of the Hilton-Milner theorem for set partitions (Q2349184) (← links)
- On the partition associated to the smallest eigenvalues of the \(k\)-point fixing graph (Q2357222) (← links)
- Maximum multiplicity of a root of the matching polynomial of a tree and minimum path cover (Q2380236) (← links)
- The covering radius problem for sets of 1-factors of the complete uniform hypergraphs (Q2407022) (← links)
- Gallai-Edmonds structure theorem for weighted matching polynomial (Q2435543) (← links)
- Solving the Ku-Wales conjecture on the eigenvalues of the derangement graph (Q2444728) (← links)
- (Q2844307) (← links)
- (Q3190510) (← links)
- Independent sets of maximal size in tensor powers of vertex-transitive graphs (Q3633011) (← links)
- (Q5148147) (← links)
- AN ANALOGUE OF THE HILTON-MILNER THEOREM FOR WEAK COMPOSITIONS (Q5265572) (← links)
- AN ERDŐS-KO-RADO THEOREM FOR MINIMAL COVERS (Q5357940) (← links)
- On AZ-style identity (Q6226427) (← links)
- A generalization of the extremal function of the Davenport-Schinzel sequences (Q6246274) (← links)