From the 1 of 9 linked papers with an AI index.
9 papers
On a conjecture of Kolokolnikov on algebraic connectivity
Cheng Chi, Junjie Wang, Jiaxin Zheng
For a graph , let be the second smallest eigenvalue of the Laplacian matrix of , also known as the algebraic connectivity. Algebraic connectivity plays an important ro…
On three open problems in zero-sum Ramsey numbers
Cheng Chi, Jialin He, Quan Sun
Let denote the -vertex complete -uniform hypergraph. For an -uniform hypergraph and an integer , the -color Ramsey number is the least…
Extremal Families for the ErdÅs--Kleitman Problem: The Missing Constructions
Cheng Chi, Yan Wang
The paper identifies new extremal families for the Erdős–Kleitman problem by analyzing weighted constructions and confirms the Frankl–Kupavskii meta‑conjecture in many parameter ra…
A note on zero-sum Ramsey numbers of complete graphs
Cheng Chi, Jialin He, Fuhong Ma
For a graph with , the zero-sum Ramsey number is the least integer such that every labeling of the edges of by elements of contains a c…
On Zero-sum Ramsey numbers of complete bipartite graphs
Cheng Chi, Jialin He
For an integer and a graph satisfying , the zero-sum Ramsey number is the least integer such that every edge-labeling $w\colon E(K_n…
New Extremal Ranges and Constructions of the ErdÅs--Kleitman Problem
Cheng Chi, Yan Wang
For integers , let denote the maximum size of a family with no pairwise disjoint members. The problem of determining ,…