2 papers
math.CO2026
Finite palette endpoints and degree-square Turán problems
Jiangdong Ai, Bin Chen, Ming Chen +2
The paper investigates extremal color‑palette problems motivated by uniform Turán densities of 3‑uniform hypergraphs, showing they reduce to maximizing the sum of squared out‑degre…
math.CO2026
A weighted cycle-localization inequality
Jiangdong Ai, Bin Chen, Ming Chen +1
In 1959, ErdÅs and Gallai showed that every -connected graph contains a cycle of length at least . This result was subsequently extended to weight…