3 papers
math.CO2026
Finite palette endpoints and degree-square Turán problems
Jiangdong Ai, Bin Chen, Ming Chen +2
We study finite palette extremal problems motivated by uniform Turán densities of -uniform hypergraphs. Given a self-converse tournament with at least two vertices, we deter…
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 weighte…
math.CO2025
Strongly regular graphs with parameters (85,14,3,2) do not exist
Sergey Shpectorov, Tianxiao Zhao
We investigate the second smallest unresolved feasible set of parameters of strongly regular graphs, . Using the classification of cubic graphs of small degr…