From the 1 of 8 linked papers with an AI index.
8 papers
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…
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…
The maximum number of triangles in graphs without vertex disjoint friendship graphs
Wanfang Chen, Jia-Bao Yang, Leilei Zhang
Given graphs and , the generalized Turán number is the maximum number of copies of among all -vertex -free graphs. The friendship graph …
Extremal problems about the order and size of nonhamiltonian locally linear graphs
Feng Liu, Leilei Zhang
The interaction between local traits and global frameworks of mathematical objects has long endured as a central theme in various mathematical domains. A graph \(G\) is referred to…
Hamiltonian Properties of 3-Connected Claw-Free Graphs and Line Graphs of 3-Hypergraphs
Kenta Ozeki, Leilei Zhang
Motivated by Thomassen's well-known line graph conjecture, many researchers have explored sufficient conditions for claw-free graphs to be Hamiltonian or Hamilton-connected. In 199…