From the 1 of 8 linked papers with an AI index.
8 papers
New upper bound for the Ramsey number of odd cycles
Ting Huang, Jiabao Yang, Yaojun Chen
The \emph{-color Ramsey number} is the least integer such that any -edge-coloring of a complete graph has a monochromatic odd cycle …
On the distinct maximal-clique sizes in -uniform hypergraphs
Jiabao Yang, Leilei Zhang
The paper proves that the number of distinct maximal‑clique sizes in 3‑uniform hypergraphs on n vertices grows on the order of the iterated logarithm log* n, settling a question of…
Proofs of two conjectures on generalizations of Brouwer's Laplacian conjecture
Junying Lu, Jiabao Yang
Let be a simple graph of order and let be the eigenvalues of its Laplacian matrix. Brouwer conjectured that for every , $…
Odd covers for complete graphs and complete 3-graphs
Ting Huang, Jiabao Yang, Yaojun Chen
The Graham-Pollak theorem says that one needs at least complete bipartite graphs to cover each edge of a complete graph on vertices exactly once. The odd cover…
Further Results on the Maximum Number of Stars in Graphs with Forbidden Properties
Yuxuan Liu, Jia-Bao Yang, Leilei Zhang
A graph is called -edge-hamiltonian if every linear forest (i.e., a disjoint union of paths) with at most edges is contained in a Hamilton cycle of . In 2018, Füredi…
Counterexamples to the Balogh-Linz-Patkós Conjecture
Jia-Bao Yang, Leilei Zhang
A set system is called -intersecting if for every pair of sets A set system is -Sperner if it does not cont…